/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:36:22,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:36:22,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:36:22,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:36:22,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:36:22,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:36:22,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:36:22,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:36:22,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:36:22,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:36:22,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:36:22,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:36:22,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:36:22,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:36:22,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:36:22,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:36:22,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:36:22,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:36:22,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:36:22,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:36:22,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:36:22,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:36:22,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:36:22,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:36:22,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:36:22,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:36:22,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:36:22,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:36:22,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:36:22,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:36:22,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:36:22,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:36:22,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:36:22,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:36:22,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:36:22,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:36:22,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:36:22,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:36:22,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:36:22,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:36:22,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:36:22,808 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:36:22,822 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:36:22,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:36:22,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:36:22,824 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:36:22,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:36:22,824 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:36:22,824 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:36:22,825 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:36:22,825 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:36:22,825 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:36:22,825 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:36:22,825 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:36:22,826 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:36:22,826 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:36:22,826 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:36:22,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:36:22,826 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:36:22,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:36:22,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:36:22,827 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:36:22,827 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:36:22,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:36:22,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:36:22,827 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:36:22,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:36:22,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:36:22,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:36:22,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:36:22,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:36:22,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:36:23,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:36:23,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:36:23,012 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:36:23,012 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:36:23,013 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:36:27,691 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_5CgJVy/tmp/d4a835f20c284b6a940d39b600437717/FLAGf194e3a27 !SESSION 2020-07-01 12:36:19.955 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_5CgJVy/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 12:36:27.790 !MESSAGE Indexed 'FLAGf194e3a27' (0 sources, 0 headers) in 0.002 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 12:36:28,022 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:36:28,023 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:36:28,023 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:36:28,030 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_5CgJVy/tmp/d4a835f20c284b6a940d39b600437717/FLAGf194e3a27 [2020-07-01 12:36:28,068 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_5CgJVy/tmp/d4a835f20c284b6a940d39b600437717 [2020-07-01 12:36:28,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:36:28,080 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:36:28,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:36:28,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:36:28,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:36:28,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9d7b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28, skipping insertion in model container [2020-07-01 12:36:28,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:36:28,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:36:28,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:36:28,366 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:36:28,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:36:28,400 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:36:28,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28 WrapperNode [2020-07-01 12:36:28,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:36:28,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:36:28,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:36:28,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:36:28,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:36:28,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:36:28,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:36:28,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:36:28,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:36:28,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:36:28,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:36:28,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:36:28,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:36:28,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:36:28,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:36:28,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:36:28,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:36:28,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:36:28,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:36:28,832 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:36:28,833 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:36:28,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:28 BoogieIcfgContainer [2020-07-01 12:36:28,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:36:28,837 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:36:28,838 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:36:28,840 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:36:28,840 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:28" (1/1) ... [2020-07-01 12:36:28,857 INFO L313 BlockEncoder]: Initial Icfg 53 locations, 58 edges [2020-07-01 12:36:28,859 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:36:28,859 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:36:28,860 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:36:28,860 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:36:28,862 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:36:28,863 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:36:28,863 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:36:28,891 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:36:28,926 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 12:36:28,931 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:36:28,932 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:28,969 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:36:28,972 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:36:28,974 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:36:28,974 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:28,974 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:36:28,975 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:36:28,976 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 83 edges [2020-07-01 12:36:28,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:28 BasicIcfg [2020-07-01 12:36:28,976 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:36:28,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:36:28,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:36:28,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:36:28,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:36:28" (1/4) ... [2020-07-01 12:36:28,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c199a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:36:28, skipping insertion in model container [2020-07-01 12:36:28,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (2/4) ... [2020-07-01 12:36:28,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c199a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:36:28, skipping insertion in model container [2020-07-01 12:36:28,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:28" (3/4) ... [2020-07-01 12:36:28,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c199a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:28, skipping insertion in model container [2020-07-01 12:36:28,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:28" (4/4) ... [2020-07-01 12:36:28,985 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:36:28,995 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:36:29,003 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-07-01 12:36:29,017 INFO L251 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-07-01 12:36:29,040 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:36:29,040 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:36:29,040 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:36:29,041 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:36:29,041 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:36:29,041 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:36:29,041 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:36:29,041 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:36:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-01 12:36:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:29,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:29,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:29,064 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash 131525, now seen corresponding path program 1 times [2020-07-01 12:36:29,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:29,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748671538] [2020-07-01 12:36:29,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:29,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748671538] [2020-07-01 12:36:29,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:29,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:29,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005412718] [2020-07-01 12:36:29,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:29,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:29,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:29,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,259 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-01 12:36:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:29,405 INFO L93 Difference]: Finished difference Result 86 states and 157 transitions. [2020-07-01 12:36:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:29,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:29,420 INFO L225 Difference]: With dead ends: 86 [2020-07-01 12:36:29,420 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:36:29,424 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:36:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:36:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:36:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 76 transitions. [2020-07-01 12:36:29,465 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 76 transitions. Word has length 3 [2020-07-01 12:36:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:29,466 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 76 transitions. [2020-07-01 12:36:29,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 76 transitions. [2020-07-01 12:36:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:29,466 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:29,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:29,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:36:29,469 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash 131463, now seen corresponding path program 1 times [2020-07-01 12:36:29,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:29,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568859553] [2020-07-01 12:36:29,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:29,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568859553] [2020-07-01 12:36:29,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:29,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:29,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293738790] [2020-07-01 12:36:29,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:29,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:29,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:29,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,534 INFO L87 Difference]: Start difference. First operand 44 states and 76 transitions. Second operand 3 states. [2020-07-01 12:36:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:29,644 INFO L93 Difference]: Finished difference Result 44 states and 76 transitions. [2020-07-01 12:36:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:29,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:29,646 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:36:29,647 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:36:29,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:36:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:36:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:36:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 68 transitions. [2020-07-01 12:36:29,653 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 68 transitions. Word has length 3 [2020-07-01 12:36:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:29,654 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 68 transitions. [2020-07-01 12:36:29,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 68 transitions. [2020-07-01 12:36:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:29,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:29,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:29,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:36:29,655 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash 131465, now seen corresponding path program 1 times [2020-07-01 12:36:29,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:29,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598852924] [2020-07-01 12:36:29,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:29,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598852924] [2020-07-01 12:36:29,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:29,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:29,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953642270] [2020-07-01 12:36:29,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:29,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,689 INFO L87 Difference]: Start difference. First operand 40 states and 68 transitions. Second operand 3 states. [2020-07-01 12:36:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:29,764 INFO L93 Difference]: Finished difference Result 44 states and 68 transitions. [2020-07-01 12:36:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:29,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:29,766 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:36:29,766 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:36:29,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:36:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:36:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:36:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2020-07-01 12:36:29,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 3 [2020-07-01 12:36:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:29,772 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 64 transitions. [2020-07-01 12:36:29,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2020-07-01 12:36:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:29,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:29,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:29,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:36:29,773 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash 131466, now seen corresponding path program 1 times [2020-07-01 12:36:29,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:29,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208916795] [2020-07-01 12:36:29,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:29,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208916795] [2020-07-01 12:36:29,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:29,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:29,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778491935] [2020-07-01 12:36:29,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:29,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,815 INFO L87 Difference]: Start difference. First operand 40 states and 64 transitions. Second operand 3 states. [2020-07-01 12:36:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:29,917 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2020-07-01 12:36:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:29,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:29,919 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:36:29,919 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:36:29,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:36:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:36:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:36:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2020-07-01 12:36:29,924 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 3 [2020-07-01 12:36:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:29,925 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2020-07-01 12:36:29,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2020-07-01 12:36:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:36:29,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:29,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:29,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:36:29,926 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash -379804101, now seen corresponding path program 1 times [2020-07-01 12:36:29,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:29,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099512913] [2020-07-01 12:36:29,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:29,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099512913] [2020-07-01 12:36:29,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:29,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:36:29,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914601635] [2020-07-01 12:36:29,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:29,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:29,953 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2020-07-01 12:36:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,067 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2020-07-01 12:36:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:36:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,087 INFO L225 Difference]: With dead ends: 78 [2020-07-01 12:36:30,087 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:36:30,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:36:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2020-07-01 12:36:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:36:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 62 transitions. [2020-07-01 12:36:30,093 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 62 transitions. Word has length 6 [2020-07-01 12:36:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,093 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 62 transitions. [2020-07-01 12:36:30,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 62 transitions. [2020-07-01 12:36:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:36:30,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:30,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:36:30,095 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash -379803140, now seen corresponding path program 1 times [2020-07-01 12:36:30,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364142583] [2020-07-01 12:36:30,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364142583] [2020-07-01 12:36:30,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:30,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026231778] [2020-07-01 12:36:30,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:30,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,134 INFO L87 Difference]: Start difference. First operand 38 states and 62 transitions. Second operand 3 states. [2020-07-01 12:36:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,209 INFO L93 Difference]: Finished difference Result 38 states and 62 transitions. [2020-07-01 12:36:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:36:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,211 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:36:30,211 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:36:30,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:36:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:36:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:36:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-07-01 12:36:30,215 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 6 [2020-07-01 12:36:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,216 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-07-01 12:36:30,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-07-01 12:36:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:36:30,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:30,216 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:36:30,217 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash -379803138, now seen corresponding path program 1 times [2020-07-01 12:36:30,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985473227] [2020-07-01 12:36:30,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985473227] [2020-07-01 12:36:30,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:30,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024690758] [2020-07-01 12:36:30,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:30,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,259 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 3 states. [2020-07-01 12:36:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,326 INFO L93 Difference]: Finished difference Result 35 states and 56 transitions. [2020-07-01 12:36:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:36:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,327 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:36:30,327 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:36:30,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:36:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:36:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:36:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. [2020-07-01 12:36:30,332 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 50 transitions. Word has length 6 [2020-07-01 12:36:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,332 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 50 transitions. [2020-07-01 12:36:30,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2020-07-01 12:36:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:36:30,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:30,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:36:30,333 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 80517235, now seen corresponding path program 1 times [2020-07-01 12:36:30,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971230349] [2020-07-01 12:36:30,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971230349] [2020-07-01 12:36:30,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:36:30,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632135215] [2020-07-01 12:36:30,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:30,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,358 INFO L87 Difference]: Start difference. First operand 32 states and 50 transitions. Second operand 3 states. [2020-07-01 12:36:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,424 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2020-07-01 12:36:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:36:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,425 INFO L225 Difference]: With dead ends: 64 [2020-07-01 12:36:30,425 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:36:30,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:36:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:36:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:36:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2020-07-01 12:36:30,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 8 [2020-07-01 12:36:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,429 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-07-01 12:36:30,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2020-07-01 12:36:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:36:30,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:30,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:36:30,430 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,431 INFO L82 PathProgramCache]: Analyzing trace with hash 866171089, now seen corresponding path program 1 times [2020-07-01 12:36:30,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91120113] [2020-07-01 12:36:30,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91120113] [2020-07-01 12:36:30,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:30,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546267087] [2020-07-01 12:36:30,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:30,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,462 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 3 states. [2020-07-01 12:36:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,515 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2020-07-01 12:36:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 12:36:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,516 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:36:30,516 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:36:30,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:36:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:36:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:36:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-01 12:36:30,520 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 10 [2020-07-01 12:36:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,520 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-01 12:36:30,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-01 12:36:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:36:30,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:30,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:36:30,522 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,522 INFO L82 PathProgramCache]: Analyzing trace with hash 866171091, now seen corresponding path program 1 times [2020-07-01 12:36:30,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117131670] [2020-07-01 12:36:30,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117131670] [2020-07-01 12:36:30,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:30,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321881422] [2020-07-01 12:36:30,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:30,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,554 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 3 states. [2020-07-01 12:36:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,581 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-01 12:36:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 12:36:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,583 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:36:30,583 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:36:30,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:36:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:36:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:36:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2020-07-01 12:36:30,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2020-07-01 12:36:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,587 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-07-01 12:36:30,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-01 12:36:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:36:30,588 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:30,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:36:30,588 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash 866171092, now seen corresponding path program 1 times [2020-07-01 12:36:30,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491482502] [2020-07-01 12:36:30,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491482502] [2020-07-01 12:36:30,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:30,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519560972] [2020-07-01 12:36:30,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:30,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,623 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2020-07-01 12:36:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,654 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-01 12:36:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 12:36:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:30,655 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:36:30,655 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:36:30,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:36:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:36:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:36:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:36:30,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-07-01 12:36:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:30,657 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:36:30,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:36:30,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:36:30,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:36:30,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:36:30,699 INFO L268 CegarLoopResult]: For program point L10-9(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point L10-11(lines 10 20) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point L11(lines 11 19) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:30,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:36:30,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,702 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:36:30,702 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:36:30,702 INFO L268 CegarLoopResult]: For program point L13(lines 13 19) no Hoare annotation was computed. [2020-07-01 12:36:30,702 INFO L264 CegarLoopResult]: At program point L13-2(lines 10 20) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~z~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:36:30,703 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,704 INFO L268 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,705 INFO L268 CegarLoopResult]: For program point L10-6(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,705 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,705 INFO L268 CegarLoopResult]: For program point L10-7(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,705 INFO L268 CegarLoopResult]: For program point L10-8(line 10) no Hoare annotation was computed. [2020-07-01 12:36:30,708 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:36:30,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:30,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:30,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:30 BasicIcfg [2020-07-01 12:36:30,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:36:30,729 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:36:30,729 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:36:30,733 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:36:30,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:30,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:36:28" (1/5) ... [2020-07-01 12:36:30,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@475d77ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:36:30, skipping insertion in model container [2020-07-01 12:36:30,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:30,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:28" (2/5) ... [2020-07-01 12:36:30,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@475d77ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:36:30, skipping insertion in model container [2020-07-01 12:36:30,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:30,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:28" (3/5) ... [2020-07-01 12:36:30,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@475d77ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:36:30, skipping insertion in model container [2020-07-01 12:36:30,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:30,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:28" (4/5) ... [2020-07-01 12:36:30,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@475d77ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:36:30, skipping insertion in model container [2020-07-01 12:36:30,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:30,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:30" (5/5) ... [2020-07-01 12:36:30,737 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:36:30,761 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:36:30,762 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:36:30,762 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:36:30,762 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:36:30,762 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:36:30,762 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:36:30,762 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:36:30,762 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:36:30,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-01 12:36:30,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-01 12:36:30,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:36:30,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:36:30,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 12:36:30,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,777 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:36:30,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-01 12:36:30,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-01 12:36:30,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:36:30,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:36:30,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 12:36:30,780 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:30,785 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [100] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [175] L-1-->L13-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 36#L13-2true [2020-07-01 12:36:30,786 INFO L796 eck$LassoCheckResult]: Loop: 36#L13-2true [130] L13-2-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 31#L10-1true [182] L10-1-->L10-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem3_3|) (not |v_ULTIMATE.start_main_#t~short5_2|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 29#L10-2true [125] L10-2-->L10-6: Formula: (not |v_ULTIMATE.start_main_#t~short5_5|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} AuxVars[] AssignedVars[] 45#L10-6true [188] L10-6-->L10-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short5_6|) (not |v_ULTIMATE.start_main_#t~short7_2|)) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 43#L10-7true [140] L10-7-->L10-11: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 33#L10-11true [128] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 37#L11true [198] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 15#L12true [110] L12-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 13#L12-1true [237] L12-1-->L13-2: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 36#L13-2true [2020-07-01 12:36:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 4236, now seen corresponding path program 1 times [2020-07-01 12:36:30,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552246374] [2020-07-01 12:36:30,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552246374] [2020-07-01 12:36:30,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 12:36:30,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023069919] [2020-07-01 12:36:30,804 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:36:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 910932285, now seen corresponding path program 1 times [2020-07-01 12:36:30,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:30,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750526129] [2020-07-01 12:36:30,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:30,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750526129] [2020-07-01 12:36:30,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:30,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:36:30,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863458354] [2020-07-01 12:36:30,816 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:36:30,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:30,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:30,817 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-01 12:36:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:30,885 INFO L93 Difference]: Finished difference Result 44 states and 76 transitions. [2020-07-01 12:36:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:30,888 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:36:30,892 INFO L168 Benchmark]: Toolchain (without parser) took 2811.30 ms. Allocated memory was 514.9 MB in the beginning and 584.1 MB in the end (delta: 69.2 MB). Free memory was 436.1 MB in the beginning and 399.0 MB in the end (delta: 37.1 MB). Peak memory consumption was 106.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,893 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:36:30,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.17 ms. Allocated memory was 514.9 MB in the beginning and 542.1 MB in the end (delta: 27.3 MB). Free memory was 435.4 MB in the beginning and 510.5 MB in the end (delta: -75.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.35 ms. Allocated memory is still 542.1 MB. Free memory was 510.5 MB in the beginning and 508.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,894 INFO L168 Benchmark]: Boogie Preprocessor took 25.01 ms. Allocated memory is still 542.1 MB. Free memory was 508.9 MB in the beginning and 507.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,895 INFO L168 Benchmark]: RCFGBuilder took 369.02 ms. Allocated memory is still 542.1 MB. Free memory was 507.3 MB in the beginning and 483.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,896 INFO L168 Benchmark]: BlockEncodingV2 took 138.83 ms. Allocated memory is still 542.1 MB. Free memory was 483.0 MB in the beginning and 472.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,896 INFO L168 Benchmark]: TraceAbstraction took 1751.44 ms. Allocated memory was 542.1 MB in the beginning and 584.1 MB in the end (delta: 41.9 MB). Free memory was 471.8 MB in the beginning and 425.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 88.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,897 INFO L168 Benchmark]: BuchiAutomizer took 160.61 ms. Allocated memory is still 584.1 MB. Free memory was 423.4 MB in the beginning and 399.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:30,900 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 53 locations, 58 edges - StatisticsResult: Encoded RCFG 44 locations, 83 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 320.17 ms. Allocated memory was 514.9 MB in the beginning and 542.1 MB in the end (delta: 27.3 MB). Free memory was 435.4 MB in the beginning and 510.5 MB in the end (delta: -75.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.35 ms. Allocated memory is still 542.1 MB. Free memory was 510.5 MB in the beginning and 508.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.01 ms. Allocated memory is still 542.1 MB. Free memory was 508.9 MB in the beginning and 507.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 369.02 ms. Allocated memory is still 542.1 MB. Free memory was 507.3 MB in the beginning and 483.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 138.83 ms. Allocated memory is still 542.1 MB. Free memory was 483.0 MB in the beginning and 472.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1751.44 ms. Allocated memory was 542.1 MB in the beginning and 584.1 MB in the end (delta: 41.9 MB). Free memory was 471.8 MB in the beginning and 425.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 88.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 160.61 ms. Allocated memory is still 584.1 MB. Free memory was 423.4 MB in the beginning and 399.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 12:36:30,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,910 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,910 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,910 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:30,911 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,911 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,911 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:30,911 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && 4 == unknown-#length-unknown[z]) && \valid[x] == 1) && 0 == z) && 1 == \valid[z]) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 22 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 127 SDtfs, 428 SDslu, 95 SDs, 0 SdLazy, 513 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 1675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:36:31.134 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check