/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:07,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:07,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:07,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:07,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:07,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:07,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:07,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:07,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:07,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:07,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:08,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:08,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:08,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:08,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:08,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:08,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:08,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:08,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:08,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:08,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:08,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:08,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:08,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:08,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:08,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:08,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:08,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:08,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:08,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:08,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:08,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:08,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:08,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:08,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:08,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:08,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:08,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:08,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:08,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:08,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:08,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:08,072 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:08,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:08,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:08,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:08,076 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:08,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:08,076 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:08,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:08,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:08,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:08,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:08,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:08,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:08,079 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:08,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:08,080 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:08,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:08,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:08,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:08,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:08,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:08,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:08,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:08,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:08,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:08,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:08,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:08,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:08,082 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:08,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:08,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:08,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:08,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:08,394 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:08,395 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:08,395 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-10 15:28:08,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f311bcf/4b8c38c9de9b475ea302bc9c15de4cc1/FLAG0b1862a8e [2020-07-10 15:28:08,960 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:08,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-10 15:28:08,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f311bcf/4b8c38c9de9b475ea302bc9c15de4cc1/FLAG0b1862a8e [2020-07-10 15:28:09,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f311bcf/4b8c38c9de9b475ea302bc9c15de4cc1 [2020-07-10 15:28:09,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:09,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:09,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:09,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:09,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:09,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f98808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09, skipping insertion in model container [2020-07-10 15:28:09,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:09,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:09,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:09,659 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:09,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:09,708 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:09,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09 WrapperNode [2020-07-10 15:28:09,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:09,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:09,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:09,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:09,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... [2020-07-10 15:28:09,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:09,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:09,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:09,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:09,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:28:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:28:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:28:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:28:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:10,285 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:10,285 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:28:10,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:10 BoogieIcfgContainer [2020-07-10 15:28:10,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:10,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:10,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:10,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:10,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:09" (1/3) ... [2020-07-10 15:28:10,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee2ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:10, skipping insertion in model container [2020-07-10 15:28:10,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:09" (2/3) ... [2020-07-10 15:28:10,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee2ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:10, skipping insertion in model container [2020-07-10 15:28:10,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:10" (3/3) ... [2020-07-10 15:28:10,308 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2020-07-10 15:28:10,326 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:10,350 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:10,400 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:10,460 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:10,460 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:10,460 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:10,461 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:10,461 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:10,461 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:10,462 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:10,462 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-10 15:28:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:28:10,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:10,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:10,497 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash -413900697, now seen corresponding path program 1 times [2020-07-10 15:28:10,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:10,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515469145] [2020-07-10 15:28:10,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-10 15:28:10,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:28:10,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2020-07-10 15:28:10,767 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:10,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-10 15:28:10,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:28:10,769 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2020-07-10 15:28:10,770 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2020-07-10 15:28:10,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2020-07-10 15:28:10,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-10 15:28:10,772 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2020-07-10 15:28:10,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-10 15:28:10,773 INFO L263 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29#false} is VALID [2020-07-10 15:28:10,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2020-07-10 15:28:10,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2020-07-10 15:28:10,775 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-10 15:28:10,776 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-10 15:28:10,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515469145] [2020-07-10 15:28:10,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:10,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:28:10,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381794365] [2020-07-10 15:28:10,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:28:10,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:10,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:28:10,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:10,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:28:10,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:28:10,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:28:10,864 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-10 15:28:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,057 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-10 15:28:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:28:11,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:28:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2020-07-10 15:28:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2020-07-10 15:28:11,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2020-07-10 15:28:11,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:11,182 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:28:11,182 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:28:11,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 15:28:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:28:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 15:28:11,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:11,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 15:28:11,247 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:28:11,248 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:28:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,252 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-10 15:28:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-10 15:28:11,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,254 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:28:11,254 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:28:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,259 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-10 15:28:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-10 15:28:11,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:11,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:28:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-10 15:28:11,266 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2020-07-10 15:28:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:11,266 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-10 15:28:11,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:28:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-10 15:28:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:28:11,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:11,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:11,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:11,269 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:11,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2053026861, now seen corresponding path program 1 times [2020-07-10 15:28:11,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:11,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198671800] [2020-07-10 15:28:11,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {151#true} is VALID [2020-07-10 15:28:11,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 15:28:11,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-10 15:28:11,427 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:11,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {151#true} is VALID [2020-07-10 15:28:11,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 15:28:11,429 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-10 15:28:11,430 INFO L263 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-10 15:28:11,434 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {156#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:11,435 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(= 0 main_~i~0)} assume !(~i~0 < 1024); {152#false} is VALID [2020-07-10 15:28:11,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 0; {152#false} is VALID [2020-07-10 15:28:11,437 INFO L280 TraceCheckUtils]: 8: Hoare triple {152#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {152#false} is VALID [2020-07-10 15:28:11,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {152#false} assume !(0 != #t~mem3);havoc #t~mem3; {152#false} is VALID [2020-07-10 15:28:11,439 INFO L263 TraceCheckUtils]: 10: Hoare triple {152#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {152#false} is VALID [2020-07-10 15:28:11,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2020-07-10 15:28:11,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2020-07-10 15:28:11,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2020-07-10 15:28:11,441 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-10 15:28:11,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198671800] [2020-07-10 15:28:11,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:11,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:11,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595934265] [2020-07-10 15:28:11,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:28:11,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:11,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:11,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:11,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:11,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:11,479 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2020-07-10 15:28:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,694 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-10 15:28:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:28:11,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:28:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-10 15:28:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-10 15:28:11,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-10 15:28:11,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:11,788 INFO L225 Difference]: With dead ends: 35 [2020-07-10 15:28:11,788 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:28:11,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:28:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-07-10 15:28:11,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:11,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2020-07-10 15:28:11,815 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2020-07-10 15:28:11,815 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2020-07-10 15:28:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,818 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-10 15:28:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:28:11,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,820 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2020-07-10 15:28:11,820 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2020-07-10 15:28:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,823 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-10 15:28:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:28:11,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:11,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:28:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-07-10 15:28:11,828 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2020-07-10 15:28:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:11,828 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-10 15:28:11,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-10 15:28:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:28:11,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:11,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:11,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:11,830 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1766388751, now seen corresponding path program 1 times [2020-07-10 15:28:11,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:11,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624887358] [2020-07-10 15:28:11,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-10 15:28:11,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2020-07-10 15:28:11,920 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #54#return; {291#true} is VALID [2020-07-10 15:28:11,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {298#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:11,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-10 15:28:11,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2020-07-10 15:28:11,923 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #54#return; {291#true} is VALID [2020-07-10 15:28:11,923 INFO L263 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret4 := main(); {291#true} is VALID [2020-07-10 15:28:11,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {296#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:11,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {296#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {296#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:11,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {296#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {297#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:11,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= main_~i~0 1)} assume !(~i~0 < 1024); {292#false} is VALID [2020-07-10 15:28:11,930 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0; {292#false} is VALID [2020-07-10 15:28:11,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {292#false} is VALID [2020-07-10 15:28:11,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(0 != #t~mem3);havoc #t~mem3; {292#false} is VALID [2020-07-10 15:28:11,931 INFO L263 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {292#false} is VALID [2020-07-10 15:28:11,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2020-07-10 15:28:11,931 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2020-07-10 15:28:11,932 INFO L280 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2020-07-10 15:28:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:11,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624887358] [2020-07-10 15:28:11,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399163923] [2020-07-10 15:28:11,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:28:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:12,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2020-07-10 15:28:12,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-10 15:28:12,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2020-07-10 15:28:12,111 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #54#return; {291#true} is VALID [2020-07-10 15:28:12,112 INFO L263 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret4 := main(); {291#true} is VALID [2020-07-10 15:28:12,113 INFO L280 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {317#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:12,115 INFO L280 TraceCheckUtils]: 6: Hoare triple {317#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {317#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:12,116 INFO L280 TraceCheckUtils]: 7: Hoare triple {317#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {297#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:12,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= main_~i~0 1)} assume !(~i~0 < 1024); {292#false} is VALID [2020-07-10 15:28:12,119 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0; {292#false} is VALID [2020-07-10 15:28:12,119 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {292#false} is VALID [2020-07-10 15:28:12,119 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(0 != #t~mem3);havoc #t~mem3; {292#false} is VALID [2020-07-10 15:28:12,120 INFO L263 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {292#false} is VALID [2020-07-10 15:28:12,120 INFO L280 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2020-07-10 15:28:12,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2020-07-10 15:28:12,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2020-07-10 15:28:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:12,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:12,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:28:12,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150946706] [2020-07-10 15:28:12,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:28:12,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:12,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:12,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:12,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:12,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:12,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:12,156 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2020-07-10 15:28:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,381 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2020-07-10 15:28:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:12,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:28:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-10 15:28:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-10 15:28:12,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-10 15:28:12,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:12,464 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:28:12,465 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:28:12,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:28:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-10 15:28:12,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:12,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2020-07-10 15:28:12,485 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2020-07-10 15:28:12,486 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2020-07-10 15:28:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,489 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 15:28:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:28:12,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:12,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:12,491 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2020-07-10 15:28:12,491 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2020-07-10 15:28:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,494 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 15:28:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:28:12,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:12,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:12,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:12,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:28:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-10 15:28:12,499 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-10 15:28:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:12,500 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-10 15:28:12,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 15:28:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:28:12,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:12,501 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:12,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:28:12,717 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1185071985, now seen corresponding path program 2 times [2020-07-10 15:28:12,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:12,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79285516] [2020-07-10 15:28:12,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-10 15:28:12,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 15:28:12,817 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {514#true} {514#true} #54#return; {514#true} is VALID [2020-07-10 15:28:12,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:12,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-10 15:28:12,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 15:28:12,820 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #54#return; {514#true} is VALID [2020-07-10 15:28:12,820 INFO L263 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2020-07-10 15:28:12,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {519#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:12,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {519#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {519#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:12,824 INFO L280 TraceCheckUtils]: 7: Hoare triple {519#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:12,825 INFO L280 TraceCheckUtils]: 8: Hoare triple {520#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {520#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:12,827 INFO L280 TraceCheckUtils]: 9: Hoare triple {520#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {521#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:12,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#(<= main_~i~0 2)} assume !(~i~0 < 1024); {515#false} is VALID [2020-07-10 15:28:12,829 INFO L280 TraceCheckUtils]: 11: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-10 15:28:12,829 INFO L280 TraceCheckUtils]: 12: Hoare triple {515#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {515#false} is VALID [2020-07-10 15:28:12,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {515#false} assume !(0 != #t~mem3);havoc #t~mem3; {515#false} is VALID [2020-07-10 15:28:12,830 INFO L263 TraceCheckUtils]: 14: Hoare triple {515#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {515#false} is VALID [2020-07-10 15:28:12,830 INFO L280 TraceCheckUtils]: 15: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2020-07-10 15:28:12,830 INFO L280 TraceCheckUtils]: 16: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2020-07-10 15:28:12,831 INFO L280 TraceCheckUtils]: 17: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-10 15:28:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:12,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79285516] [2020-07-10 15:28:12,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527493728] [2020-07-10 15:28:12,833 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:12,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:28:12,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:12,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:28:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:12,961 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:13,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2020-07-10 15:28:13,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-10 15:28:13,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 15:28:13,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #54#return; {514#true} is VALID [2020-07-10 15:28:13,043 INFO L263 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2020-07-10 15:28:13,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {514#true} is VALID [2020-07-10 15:28:13,043 INFO L280 TraceCheckUtils]: 6: Hoare triple {514#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {514#true} is VALID [2020-07-10 15:28:13,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {514#true} is VALID [2020-07-10 15:28:13,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {514#true} is VALID [2020-07-10 15:28:13,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {514#true} is VALID [2020-07-10 15:28:13,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} assume !(~i~0 < 1024); {514#true} is VALID [2020-07-10 15:28:13,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} ~i~0 := 0; {559#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:13,048 INFO L280 TraceCheckUtils]: 12: Hoare triple {559#(<= main_~i~0 0)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {559#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:13,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {559#(<= main_~i~0 0)} assume !(0 != #t~mem3);havoc #t~mem3; {559#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:13,050 INFO L263 TraceCheckUtils]: 14: Hoare triple {559#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:13,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:13,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2020-07-10 15:28:13,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-10 15:28:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:28:13,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:13,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-07-10 15:28:13,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155152056] [2020-07-10 15:28:13,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:28:13,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:13,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:13,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:13,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:13,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:13,078 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-10 15:28:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,211 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-10 15:28:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:13,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:28:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-10 15:28:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-10 15:28:13,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-10 15:28:13,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:13,262 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:28:13,263 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:28:13,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:28:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 15:28:13,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:13,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:13,283 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:13,283 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,285 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:28:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:28:13,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:13,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:13,287 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:13,287 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,289 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:28:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:28:13,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:13,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:13,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:13,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:28:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-10 15:28:13,292 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2020-07-10 15:28:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:13,292 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-10 15:28:13,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:28:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:28:13,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:13,294 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:13,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:13,509 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1169510792, now seen corresponding path program 1 times [2020-07-10 15:28:13,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:13,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068061188] [2020-07-10 15:28:13,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#true} is VALID [2020-07-10 15:28:13,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-10 15:28:13,595 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {724#true} {724#true} #54#return; {724#true} is VALID [2020-07-10 15:28:13,597 INFO L263 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {732#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:13,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#true} is VALID [2020-07-10 15:28:13,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-10 15:28:13,598 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #54#return; {724#true} is VALID [2020-07-10 15:28:13,598 INFO L263 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret4 := main(); {724#true} is VALID [2020-07-10 15:28:13,599 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {729#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:13,600 INFO L280 TraceCheckUtils]: 6: Hoare triple {729#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {729#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:13,601 INFO L280 TraceCheckUtils]: 7: Hoare triple {729#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {730#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:13,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {730#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {730#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:13,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {730#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {731#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:13,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#(<= main_~i~0 2)} assume !(~i~0 < 1024); {725#false} is VALID [2020-07-10 15:28:13,604 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#false} ~i~0 := 0; {725#false} is VALID [2020-07-10 15:28:13,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-10 15:28:13,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {725#false} assume !!(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-10 15:28:13,605 INFO L280 TraceCheckUtils]: 14: Hoare triple {725#false} assume !(~i~0 >= 1023); {725#false} is VALID [2020-07-10 15:28:13,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {725#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {725#false} is VALID [2020-07-10 15:28:13,606 INFO L280 TraceCheckUtils]: 16: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-10 15:28:13,606 INFO L280 TraceCheckUtils]: 17: Hoare triple {725#false} assume !(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-10 15:28:13,606 INFO L263 TraceCheckUtils]: 18: Hoare triple {725#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {725#false} is VALID [2020-07-10 15:28:13,607 INFO L280 TraceCheckUtils]: 19: Hoare triple {725#false} ~cond := #in~cond; {725#false} is VALID [2020-07-10 15:28:13,607 INFO L280 TraceCheckUtils]: 20: Hoare triple {725#false} assume 0 == ~cond; {725#false} is VALID [2020-07-10 15:28:13,607 INFO L280 TraceCheckUtils]: 21: Hoare triple {725#false} assume !false; {725#false} is VALID [2020-07-10 15:28:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:13,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068061188] [2020-07-10 15:28:13,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647880261] [2020-07-10 15:28:13,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:28:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:13,716 INFO L263 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2020-07-10 15:28:13,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#true} is VALID [2020-07-10 15:28:13,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-10 15:28:13,717 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #54#return; {724#true} is VALID [2020-07-10 15:28:13,717 INFO L263 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret4 := main(); {724#true} is VALID [2020-07-10 15:28:13,718 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {751#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:13,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {751#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {751#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:13,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {751#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {730#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:13,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {730#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {730#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:13,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {730#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {731#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:13,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#(<= main_~i~0 2)} assume !(~i~0 < 1024); {725#false} is VALID [2020-07-10 15:28:13,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#false} ~i~0 := 0; {725#false} is VALID [2020-07-10 15:28:13,723 INFO L280 TraceCheckUtils]: 12: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-10 15:28:13,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {725#false} assume !!(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-10 15:28:13,723 INFO L280 TraceCheckUtils]: 14: Hoare triple {725#false} assume !(~i~0 >= 1023); {725#false} is VALID [2020-07-10 15:28:13,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {725#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {725#false} is VALID [2020-07-10 15:28:13,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-10 15:28:13,724 INFO L280 TraceCheckUtils]: 17: Hoare triple {725#false} assume !(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-10 15:28:13,724 INFO L263 TraceCheckUtils]: 18: Hoare triple {725#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {725#false} is VALID [2020-07-10 15:28:13,725 INFO L280 TraceCheckUtils]: 19: Hoare triple {725#false} ~cond := #in~cond; {725#false} is VALID [2020-07-10 15:28:13,725 INFO L280 TraceCheckUtils]: 20: Hoare triple {725#false} assume 0 == ~cond; {725#false} is VALID [2020-07-10 15:28:13,725 INFO L280 TraceCheckUtils]: 21: Hoare triple {725#false} assume !false; {725#false} is VALID [2020-07-10 15:28:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:13,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:13,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:28:13,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171131845] [2020-07-10 15:28:13,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:28:13,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:13,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:13,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:13,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:13,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:13,759 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2020-07-10 15:28:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,983 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-07-10 15:28:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:13,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:28:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:28:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:28:13,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 15:28:14,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:14,059 INFO L225 Difference]: With dead ends: 55 [2020-07-10 15:28:14,059 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:28:14,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:28:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-10 15:28:14,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:14,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-10 15:28:14,097 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-10 15:28:14,097 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-10 15:28:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:14,100 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 15:28:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:28:14,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:14,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:14,102 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-10 15:28:14,102 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-10 15:28:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:14,104 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 15:28:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:28:14,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:14,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:14,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:14,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:28:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-10 15:28:14,108 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2020-07-10 15:28:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:14,108 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-10 15:28:14,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 15:28:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:28:14,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:14,109 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:14,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:14,322 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash -621810598, now seen corresponding path program 2 times [2020-07-10 15:28:14,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:14,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808386685] [2020-07-10 15:28:14,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:14,430 INFO L280 TraceCheckUtils]: 0: Hoare triple {1008#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-10 15:28:14,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#true} assume true; {999#true} is VALID [2020-07-10 15:28:14,431 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {999#true} {999#true} #54#return; {999#true} is VALID [2020-07-10 15:28:14,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {999#true} call ULTIMATE.init(); {1008#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:14,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-10 15:28:14,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#true} assume true; {999#true} is VALID [2020-07-10 15:28:14,433 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {999#true} {999#true} #54#return; {999#true} is VALID [2020-07-10 15:28:14,433 INFO L263 TraceCheckUtils]: 4: Hoare triple {999#true} call #t~ret4 := main(); {999#true} is VALID [2020-07-10 15:28:14,434 INFO L280 TraceCheckUtils]: 5: Hoare triple {999#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1004#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:14,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {1004#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1004#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:14,438 INFO L280 TraceCheckUtils]: 7: Hoare triple {1004#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1005#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:14,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {1005#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1005#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:14,440 INFO L280 TraceCheckUtils]: 9: Hoare triple {1005#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1006#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:14,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {1006#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1006#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:14,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {1006#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1007#(<= main_~i~0 3)} is VALID [2020-07-10 15:28:14,443 INFO L280 TraceCheckUtils]: 12: Hoare triple {1007#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1000#false} is VALID [2020-07-10 15:28:14,443 INFO L280 TraceCheckUtils]: 13: Hoare triple {1000#false} ~i~0 := 0; {1000#false} is VALID [2020-07-10 15:28:14,444 INFO L280 TraceCheckUtils]: 14: Hoare triple {1000#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1000#false} is VALID [2020-07-10 15:28:14,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {1000#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1000#false} is VALID [2020-07-10 15:28:14,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {1000#false} assume !(~i~0 >= 1023); {1000#false} is VALID [2020-07-10 15:28:14,444 INFO L280 TraceCheckUtils]: 17: Hoare triple {1000#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1000#false} is VALID [2020-07-10 15:28:14,445 INFO L280 TraceCheckUtils]: 18: Hoare triple {1000#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1000#false} is VALID [2020-07-10 15:28:14,445 INFO L280 TraceCheckUtils]: 19: Hoare triple {1000#false} assume !(0 != #t~mem3);havoc #t~mem3; {1000#false} is VALID [2020-07-10 15:28:14,445 INFO L263 TraceCheckUtils]: 20: Hoare triple {1000#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1000#false} is VALID [2020-07-10 15:28:14,445 INFO L280 TraceCheckUtils]: 21: Hoare triple {1000#false} ~cond := #in~cond; {1000#false} is VALID [2020-07-10 15:28:14,446 INFO L280 TraceCheckUtils]: 22: Hoare triple {1000#false} assume 0 == ~cond; {1000#false} is VALID [2020-07-10 15:28:14,446 INFO L280 TraceCheckUtils]: 23: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2020-07-10 15:28:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:14,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808386685] [2020-07-10 15:28:14,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787551636] [2020-07-10 15:28:14,448 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:14,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:28:14,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:14,483 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:28:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:14,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:14,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:14,610 INFO L263 TraceCheckUtils]: 0: Hoare triple {999#true} call ULTIMATE.init(); {999#true} is VALID [2020-07-10 15:28:14,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-10 15:28:14,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#true} assume true; {999#true} is VALID [2020-07-10 15:28:14,612 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {999#true} {999#true} #54#return; {999#true} is VALID [2020-07-10 15:28:14,612 INFO L263 TraceCheckUtils]: 4: Hoare triple {999#true} call #t~ret4 := main(); {999#true} is VALID [2020-07-10 15:28:14,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {999#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {999#true} is VALID [2020-07-10 15:28:14,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {999#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {999#true} is VALID [2020-07-10 15:28:14,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {999#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#true} is VALID [2020-07-10 15:28:14,613 INFO L280 TraceCheckUtils]: 8: Hoare triple {999#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {999#true} is VALID [2020-07-10 15:28:14,613 INFO L280 TraceCheckUtils]: 9: Hoare triple {999#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#true} is VALID [2020-07-10 15:28:14,614 INFO L280 TraceCheckUtils]: 10: Hoare triple {999#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {999#true} is VALID [2020-07-10 15:28:14,614 INFO L280 TraceCheckUtils]: 11: Hoare triple {999#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#true} is VALID [2020-07-10 15:28:14,614 INFO L280 TraceCheckUtils]: 12: Hoare triple {999#true} assume !(~i~0 < 1024); {999#true} is VALID [2020-07-10 15:28:14,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {999#true} ~i~0 := 0; {1051#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:14,617 INFO L280 TraceCheckUtils]: 14: Hoare triple {1051#(<= main_~i~0 0)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1051#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:14,617 INFO L280 TraceCheckUtils]: 15: Hoare triple {1051#(<= main_~i~0 0)} assume !!(0 != #t~mem3);havoc #t~mem3; {1051#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:14,618 INFO L280 TraceCheckUtils]: 16: Hoare triple {1051#(<= main_~i~0 0)} assume !(~i~0 >= 1023); {1051#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:14,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1005#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:14,621 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#(<= main_~i~0 1)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1005#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:14,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {1005#(<= main_~i~0 1)} assume !(0 != #t~mem3);havoc #t~mem3; {1005#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:14,623 INFO L263 TraceCheckUtils]: 20: Hoare triple {1005#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1073#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:14,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {1073#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1077#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:14,625 INFO L280 TraceCheckUtils]: 22: Hoare triple {1077#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1000#false} is VALID [2020-07-10 15:28:14,625 INFO L280 TraceCheckUtils]: 23: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2020-07-10 15:28:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-10 15:28:14,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:14,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-07-10 15:28:14,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844387165] [2020-07-10 15:28:14,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:28:14,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:14,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:28:14,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:14,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:28:14,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:14,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:28:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:14,684 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 10 states. [2020-07-10 15:28:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,103 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2020-07-10 15:28:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:15,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:28:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:28:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-10 15:28:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:28:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-10 15:28:15,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2020-07-10 15:28:15,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:15,200 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:28:15,201 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:28:15,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:28:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-10 15:28:15,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:15,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-10 15:28:15,236 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-10 15:28:15,236 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-10 15:28:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,238 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-10 15:28:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-10 15:28:15,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:15,239 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-10 15:28:15,240 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-10 15:28:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,242 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-10 15:28:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-10 15:28:15,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:15,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:15,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:28:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-10 15:28:15,245 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2020-07-10 15:28:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:15,245 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-10 15:28:15,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:28:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 15:28:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:28:15,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:15,247 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:15,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:15,461 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash -36696111, now seen corresponding path program 3 times [2020-07-10 15:28:15,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:15,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611422055] [2020-07-10 15:28:15,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:15,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1331#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2020-07-10 15:28:15,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#true} assume true; {1321#true} is VALID [2020-07-10 15:28:15,580 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1321#true} {1321#true} #54#return; {1321#true} is VALID [2020-07-10 15:28:15,582 INFO L263 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1331#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:15,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {1331#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2020-07-10 15:28:15,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2020-07-10 15:28:15,582 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #54#return; {1321#true} is VALID [2020-07-10 15:28:15,582 INFO L263 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret4 := main(); {1321#true} is VALID [2020-07-10 15:28:15,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1326#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:15,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {1326#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1326#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:15,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1327#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:15,588 INFO L280 TraceCheckUtils]: 8: Hoare triple {1327#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1327#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:15,589 INFO L280 TraceCheckUtils]: 9: Hoare triple {1327#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:15,589 INFO L280 TraceCheckUtils]: 10: Hoare triple {1328#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1328#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:15,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {1328#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 3)} is VALID [2020-07-10 15:28:15,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {1329#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1329#(<= main_~i~0 3)} is VALID [2020-07-10 15:28:15,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {1329#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 4)} is VALID [2020-07-10 15:28:15,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {1330#(<= main_~i~0 4)} assume !(~i~0 < 1024); {1322#false} is VALID [2020-07-10 15:28:15,592 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#false} ~i~0 := 0; {1322#false} is VALID [2020-07-10 15:28:15,593 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-10 15:28:15,593 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-10 15:28:15,593 INFO L280 TraceCheckUtils]: 18: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-10 15:28:15,593 INFO L280 TraceCheckUtils]: 19: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-10 15:28:15,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-10 15:28:15,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-10 15:28:15,594 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-10 15:28:15,594 INFO L280 TraceCheckUtils]: 23: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-10 15:28:15,594 INFO L280 TraceCheckUtils]: 24: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-10 15:28:15,595 INFO L280 TraceCheckUtils]: 25: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-10 15:28:15,595 INFO L280 TraceCheckUtils]: 26: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-10 15:28:15,595 INFO L280 TraceCheckUtils]: 27: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-10 15:28:15,595 INFO L280 TraceCheckUtils]: 28: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-10 15:28:15,595 INFO L280 TraceCheckUtils]: 29: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-10 15:28:15,596 INFO L280 TraceCheckUtils]: 30: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-10 15:28:15,596 INFO L280 TraceCheckUtils]: 31: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-10 15:28:15,596 INFO L280 TraceCheckUtils]: 32: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-10 15:28:15,596 INFO L280 TraceCheckUtils]: 33: Hoare triple {1322#false} assume !(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-10 15:28:15,597 INFO L263 TraceCheckUtils]: 34: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1322#false} is VALID [2020-07-10 15:28:15,597 INFO L280 TraceCheckUtils]: 35: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2020-07-10 15:28:15,597 INFO L280 TraceCheckUtils]: 36: Hoare triple {1322#false} assume 0 == ~cond; {1322#false} is VALID [2020-07-10 15:28:15,597 INFO L280 TraceCheckUtils]: 37: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2020-07-10 15:28:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-10 15:28:15,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611422055] [2020-07-10 15:28:15,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113189946] [2020-07-10 15:28:15,600 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:15,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:28:15,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:15,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:28:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:15,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:15,712 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:15,762 INFO L263 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1321#true} is VALID [2020-07-10 15:28:15,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2020-07-10 15:28:15,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2020-07-10 15:28:15,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #54#return; {1321#true} is VALID [2020-07-10 15:28:15,763 INFO L263 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret4 := main(); {1321#true} is VALID [2020-07-10 15:28:15,763 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1321#true} is VALID [2020-07-10 15:28:15,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-10 15:28:15,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-10 15:28:15,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-10 15:28:15,764 INFO L280 TraceCheckUtils]: 9: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-10 15:28:15,764 INFO L280 TraceCheckUtils]: 10: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-10 15:28:15,765 INFO L280 TraceCheckUtils]: 11: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-10 15:28:15,765 INFO L280 TraceCheckUtils]: 12: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-10 15:28:15,765 INFO L280 TraceCheckUtils]: 13: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-10 15:28:15,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#true} assume !(~i~0 < 1024); {1321#true} is VALID [2020-07-10 15:28:15,766 INFO L280 TraceCheckUtils]: 15: Hoare triple {1321#true} ~i~0 := 0; {1321#true} is VALID [2020-07-10 15:28:15,766 INFO L280 TraceCheckUtils]: 16: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-10 15:28:15,766 INFO L280 TraceCheckUtils]: 17: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-10 15:28:15,766 INFO L280 TraceCheckUtils]: 18: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1321#true} is VALID [2020-07-10 15:28:15,767 INFO L280 TraceCheckUtils]: 19: Hoare triple {1321#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1321#true} is VALID [2020-07-10 15:28:15,767 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-10 15:28:15,767 INFO L280 TraceCheckUtils]: 21: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-10 15:28:15,767 INFO L280 TraceCheckUtils]: 22: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1321#true} is VALID [2020-07-10 15:28:15,768 INFO L280 TraceCheckUtils]: 23: Hoare triple {1321#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1321#true} is VALID [2020-07-10 15:28:15,768 INFO L280 TraceCheckUtils]: 24: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-10 15:28:15,768 INFO L280 TraceCheckUtils]: 25: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-10 15:28:15,768 INFO L280 TraceCheckUtils]: 26: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1321#true} is VALID [2020-07-10 15:28:15,768 INFO L280 TraceCheckUtils]: 27: Hoare triple {1321#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1321#true} is VALID [2020-07-10 15:28:15,769 INFO L280 TraceCheckUtils]: 28: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-10 15:28:15,769 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-10 15:28:15,770 INFO L280 TraceCheckUtils]: 30: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1425#(< main_~i~0 1023)} is VALID [2020-07-10 15:28:15,771 INFO L280 TraceCheckUtils]: 31: Hoare triple {1425#(< main_~i~0 1023)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1429#(<= main_~i~0 1023)} is VALID [2020-07-10 15:28:15,771 INFO L280 TraceCheckUtils]: 32: Hoare triple {1429#(<= main_~i~0 1023)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1429#(<= main_~i~0 1023)} is VALID [2020-07-10 15:28:15,772 INFO L280 TraceCheckUtils]: 33: Hoare triple {1429#(<= main_~i~0 1023)} assume !(0 != #t~mem3);havoc #t~mem3; {1429#(<= main_~i~0 1023)} is VALID [2020-07-10 15:28:15,773 INFO L263 TraceCheckUtils]: 34: Hoare triple {1429#(<= main_~i~0 1023)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1439#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:15,774 INFO L280 TraceCheckUtils]: 35: Hoare triple {1439#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1443#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:15,774 INFO L280 TraceCheckUtils]: 36: Hoare triple {1443#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1322#false} is VALID [2020-07-10 15:28:15,774 INFO L280 TraceCheckUtils]: 37: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2020-07-10 15:28:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-07-10 15:28:15,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:15,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2020-07-10 15:28:15,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220139651] [2020-07-10 15:28:15,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:28:15,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:15,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:15,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:15,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:15,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:15,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:15,799 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 6 states. [2020-07-10 15:28:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,932 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 15:28:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:15,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:28:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-10 15:28:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-10 15:28:15,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-10 15:28:15,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:15,964 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:28:15,964 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:15,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:15,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:15,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,966 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,966 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,967 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:15,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:15,968 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,968 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,968 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:15,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:15,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:15,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:15,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-10 15:28:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:15,972 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:15,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:15,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:16,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:28:16,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:16,279 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:16,279 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:28:16,279 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:16,279 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:16,279 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:16,280 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 23) no Hoare annotation was computed. [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2020-07-10 15:28:16,280 INFO L264 CegarLoopResult]: At program point L17-4(lines 17 21) the Hoare annotation is: (<= main_~i~0 1023) [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 9 23) no Hoare annotation was computed. [2020-07-10 15:28:16,280 INFO L264 CegarLoopResult]: At program point L17-5(lines 17 21) the Hoare annotation is: (<= main_~i~0 1023) [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-07-10 15:28:16,280 INFO L271 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: true [2020-07-10 15:28:16,280 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2020-07-10 15:28:16,281 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 9 23) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:28:16,281 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-10 15:28:16,281 INFO L268 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-07-10 15:28:16,281 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 15:28:16,281 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:28:16,281 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:28:16,281 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:16,281 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-10 15:28:16,282 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:28:16,285 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:16,286 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:16,286 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:16,286 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:28:16,287 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:28:16,288 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:16,288 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:16,288 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:28:16,288 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:28:16,293 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:16,294 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:28:16,295 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:16,295 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:16,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:16 BoogieIcfgContainer [2020-07-10 15:28:16,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:16,309 INFO L168 Benchmark]: Toolchain (without parser) took 6893.26 ms. Allocated memory was 137.4 MB in the beginning and 279.4 MB in the end (delta: 142.1 MB). Free memory was 102.2 MB in the beginning and 157.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 86.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,310 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.91 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,311 INFO L168 Benchmark]: Boogie Preprocessor took 166.96 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.5 MB in the beginning and 180.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,312 INFO L168 Benchmark]: RCFGBuilder took 413.91 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 161.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,313 INFO L168 Benchmark]: TraceAbstraction took 6011.71 ms. Allocated memory was 202.4 MB in the beginning and 279.4 MB in the end (delta: 77.1 MB). Free memory was 160.6 MB in the beginning and 157.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,317 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.91 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.96 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.5 MB in the beginning and 180.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.91 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 161.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6011.71 ms. Allocated memory was 202.4 MB in the beginning and 279.4 MB in the end (delta: 77.1 MB). Free memory was 160.6 MB in the beginning and 157.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i <= 1023 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 5, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 101 SDtfs, 80 SDslu, 176 SDs, 0 SdLazy, 292 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 31 NumberOfFragments, 23 HoareAnnotationTreeSize, 17 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 263 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 10073 SizeOfPredicates, 8 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 99/140 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...