/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_24-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:40,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:40,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:40,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:40,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:40,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:40,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:40,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:40,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:40,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:40,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:40,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:40,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:40,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:40,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:40,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:40,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:40,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:40,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:40,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:40,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:40,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:40,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:40,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:40,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:40,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:40,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:40,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:40,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:40,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:40,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:40,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:40,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:40,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:40,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:40,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:40,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:40,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:40,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:40,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:40,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:40,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:20:40,634 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:40,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:40,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:40,637 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:40,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:40,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:40,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:40,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:40,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:40,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:40,638 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:40,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:40,639 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:40,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:40,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:40,639 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:40,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:40,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:40,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:40,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:40,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:40,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:40,641 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:40,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:40,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:40,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:40,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:40,987 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:40,988 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24-1.i [2020-07-10 20:20:41,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1ca7a4d/b0d721e5084c49b1b16866fc7ba7fc0b/FLAGbabf3ed57 [2020-07-10 20:20:41,660 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:41,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_24-1.i [2020-07-10 20:20:41,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1ca7a4d/b0d721e5084c49b1b16866fc7ba7fc0b/FLAGbabf3ed57 [2020-07-10 20:20:41,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1ca7a4d/b0d721e5084c49b1b16866fc7ba7fc0b [2020-07-10 20:20:41,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:42,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:42,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:42,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:42,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:42,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:41" (1/1) ... [2020-07-10 20:20:42,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173f8410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42, skipping insertion in model container [2020-07-10 20:20:42,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:41" (1/1) ... [2020-07-10 20:20:42,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:42,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:42,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:42,269 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:42,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:42,323 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:42,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42 WrapperNode [2020-07-10 20:20:42,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:42,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:42,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:42,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:42,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:42,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:42,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:42,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:42,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (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 20:20:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure printEven [2020-07-10 20:20:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure printOdd [2020-07-10 20:20:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure printEven [2020-07-10 20:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure printOdd [2020-07-10 20:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:43,185 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:43,186 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:20:43,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:43 BoogieIcfgContainer [2020-07-10 20:20:43,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:43,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:43,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:43,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:43,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:41" (1/3) ... [2020-07-10 20:20:43,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39475f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:43, skipping insertion in model container [2020-07-10 20:20:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42" (2/3) ... [2020-07-10 20:20:43,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39475f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:43, skipping insertion in model container [2020-07-10 20:20:43,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:43" (3/3) ... [2020-07-10 20:20:43,215 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_24-1.i [2020-07-10 20:20:43,230 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:43,240 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:43,261 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:43,297 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:43,297 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:43,297 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:43,298 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:43,298 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:43,298 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:43,298 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:43,299 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-10 20:20:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 20:20:43,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:43,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:43,347 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1447674201, now seen corresponding path program 1 times [2020-07-10 20:20:43,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:43,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1998556870] [2020-07-10 20:20:43,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:43,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {75#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {68#true} is VALID [2020-07-10 20:20:43,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-10 20:20:43,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-10 20:20:43,633 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 20:20:43,633 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {68#true} {68#true} #109#return; {68#true} is VALID [2020-07-10 20:20:43,639 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {75#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:43,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {68#true} is VALID [2020-07-10 20:20:43,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-10 20:20:43,641 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-10 20:20:43,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 20:20:43,642 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {68#true} {68#true} #109#return; {68#true} is VALID [2020-07-10 20:20:43,643 INFO L263 TraceCheckUtils]: 6: Hoare triple {68#true} call #t~ret9 := main(); {68#true} is VALID [2020-07-10 20:20:43,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {68#true} is VALID [2020-07-10 20:20:43,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} havoc ~i~0; {68#true} is VALID [2020-07-10 20:20:43,645 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-10 20:20:43,645 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} ~num~0 := #t~nondet0; {68#true} is VALID [2020-07-10 20:20:43,646 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-10 20:20:43,646 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#true} ~i~0 := 0; {68#true} is VALID [2020-07-10 20:20:43,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} assume !true; {69#false} is VALID [2020-07-10 20:20:43,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {69#false} ~i~0 := 0; {69#false} is VALID [2020-07-10 20:20:43,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {69#false} assume !!(~i~0 < ~num~0); {69#false} is VALID [2020-07-10 20:20:43,649 INFO L280 TraceCheckUtils]: 16: Hoare triple {69#false} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {69#false} is VALID [2020-07-10 20:20:43,650 INFO L280 TraceCheckUtils]: 17: Hoare triple {69#false} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2); {69#false} is VALID [2020-07-10 20:20:43,650 INFO L280 TraceCheckUtils]: 18: Hoare triple {69#false} havoc #t~mem4; {69#false} is VALID [2020-07-10 20:20:43,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {69#false} SUMMARY for call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L25 {69#false} is VALID [2020-07-10 20:20:43,651 INFO L263 TraceCheckUtils]: 20: Hoare triple {69#false} call printEven(#t~mem5); {69#false} is VALID [2020-07-10 20:20:43,652 INFO L280 TraceCheckUtils]: 21: Hoare triple {69#false} ~i := #in~i; {69#false} is VALID [2020-07-10 20:20:43,653 INFO L263 TraceCheckUtils]: 22: Hoare triple {69#false} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {69#false} is VALID [2020-07-10 20:20:43,653 INFO L280 TraceCheckUtils]: 23: Hoare triple {69#false} ~cond := #in~cond; {69#false} is VALID [2020-07-10 20:20:43,653 INFO L280 TraceCheckUtils]: 24: Hoare triple {69#false} assume 0 == ~cond; {69#false} is VALID [2020-07-10 20:20:43,654 INFO L280 TraceCheckUtils]: 25: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-10 20:20:43,658 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 20:20:43,659 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:43,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1998556870] [2020-07-10 20:20:43,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:43,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:43,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708285263] [2020-07-10 20:20:43,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 20:20:43,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:43,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:43,756 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 20:20:43,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:43,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:43,771 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-10 20:20:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:44,371 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2020-07-10 20:20:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:44,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 20:20:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 20:20:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 20:20:44,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-10 20:20:44,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:44,625 INFO L225 Difference]: With dead ends: 110 [2020-07-10 20:20:44,625 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 20:20:44,634 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 20:20:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 20:20:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-10 20:20:44,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:44,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2020-07-10 20:20:44,752 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-10 20:20:44,753 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-10 20:20:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:44,761 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 20:20:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 20:20:44,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:44,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:44,763 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-10 20:20:44,764 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-10 20:20:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:44,771 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 20:20:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 20:20:44,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:44,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:44,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:44,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 20:20:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2020-07-10 20:20:44,780 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 26 [2020-07-10 20:20:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:44,781 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2020-07-10 20:20:44,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:44,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 63 transitions. [2020-07-10 20:20:44,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 20:20:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 20:20:44,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:44,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:44,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:44,886 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1779758876, now seen corresponding path program 1 times [2020-07-10 20:20:44,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:44,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58154221] [2020-07-10 20:20:44,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {530#true} is VALID [2020-07-10 20:20:45,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} #valid := #valid[0 := 0]; {530#true} is VALID [2020-07-10 20:20:45,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {530#true} assume 0 < #StackHeapBarrier; {530#true} is VALID [2020-07-10 20:20:45,082 INFO L280 TraceCheckUtils]: 3: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 20:20:45,082 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {530#true} {530#true} #109#return; {530#true} is VALID [2020-07-10 20:20:45,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:45,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {530#true} is VALID [2020-07-10 20:20:45,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {530#true} #valid := #valid[0 := 0]; {530#true} is VALID [2020-07-10 20:20:45,084 INFO L280 TraceCheckUtils]: 3: Hoare triple {530#true} assume 0 < #StackHeapBarrier; {530#true} is VALID [2020-07-10 20:20:45,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 20:20:45,085 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {530#true} {530#true} #109#return; {530#true} is VALID [2020-07-10 20:20:45,085 INFO L263 TraceCheckUtils]: 6: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2020-07-10 20:20:45,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {530#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {530#true} is VALID [2020-07-10 20:20:45,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#true} havoc ~i~0; {530#true} is VALID [2020-07-10 20:20:45,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {530#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {530#true} is VALID [2020-07-10 20:20:45,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} ~num~0 := #t~nondet0; {530#true} is VALID [2020-07-10 20:20:45,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} havoc #t~nondet0; {530#true} is VALID [2020-07-10 20:20:45,089 INFO L280 TraceCheckUtils]: 12: Hoare triple {530#true} ~i~0 := 0; {537#(= 0 main_~i~0)} is VALID [2020-07-10 20:20:45,090 INFO L280 TraceCheckUtils]: 13: Hoare triple {537#(= 0 main_~i~0)} assume !(~i~0 < ~num~0); {538#(<= main_~num~0 0)} is VALID [2020-07-10 20:20:45,092 INFO L280 TraceCheckUtils]: 14: Hoare triple {538#(<= main_~num~0 0)} ~i~0 := 0; {539#(and (<= main_~num~0 0) (= 0 main_~i~0))} is VALID [2020-07-10 20:20:45,094 INFO L280 TraceCheckUtils]: 15: Hoare triple {539#(and (<= main_~num~0 0) (= 0 main_~i~0))} assume !!(~i~0 < ~num~0); {531#false} is VALID [2020-07-10 20:20:45,094 INFO L280 TraceCheckUtils]: 16: Hoare triple {531#false} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {531#false} is VALID [2020-07-10 20:20:45,095 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#false} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2); {531#false} is VALID [2020-07-10 20:20:45,095 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#false} havoc #t~mem4; {531#false} is VALID [2020-07-10 20:20:45,096 INFO L280 TraceCheckUtils]: 19: Hoare triple {531#false} SUMMARY for call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L25 {531#false} is VALID [2020-07-10 20:20:45,096 INFO L263 TraceCheckUtils]: 20: Hoare triple {531#false} call printEven(#t~mem5); {531#false} is VALID [2020-07-10 20:20:45,096 INFO L280 TraceCheckUtils]: 21: Hoare triple {531#false} ~i := #in~i; {531#false} is VALID [2020-07-10 20:20:45,097 INFO L263 TraceCheckUtils]: 22: Hoare triple {531#false} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {531#false} is VALID [2020-07-10 20:20:45,097 INFO L280 TraceCheckUtils]: 23: Hoare triple {531#false} ~cond := #in~cond; {531#false} is VALID [2020-07-10 20:20:45,097 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#false} assume 0 == ~cond; {531#false} is VALID [2020-07-10 20:20:45,098 INFO L280 TraceCheckUtils]: 25: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-10 20:20:45,099 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 20:20:45,099 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:45,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58154221] [2020-07-10 20:20:45,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:45,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:20:45,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447883082] [2020-07-10 20:20:45,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 20:20:45,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:45,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:20:45,140 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 20:20:45,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:20:45,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:20:45,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:45,141 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 6 states. [2020-07-10 20:20:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:45,749 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2020-07-10 20:20:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:20:45,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 20:20:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:20:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2020-07-10 20:20:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:20:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2020-07-10 20:20:45,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 141 transitions. [2020-07-10 20:20:45,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:45,954 INFO L225 Difference]: With dead ends: 125 [2020-07-10 20:20:45,955 INFO L226 Difference]: Without dead ends: 84 [2020-07-10 20:20:45,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-10 20:20:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2020-07-10 20:20:46,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:46,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 60 states. [2020-07-10 20:20:46,002 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 60 states. [2020-07-10 20:20:46,002 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 60 states. [2020-07-10 20:20:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:46,010 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-10 20:20:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2020-07-10 20:20:46,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:46,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:46,013 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 84 states. [2020-07-10 20:20:46,013 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 84 states. [2020-07-10 20:20:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:46,021 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-10 20:20:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2020-07-10 20:20:46,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:46,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:46,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:46,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 20:20:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2020-07-10 20:20:46,035 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 26 [2020-07-10 20:20:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:46,036 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2020-07-10 20:20:46,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:20:46,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 65 transitions. [2020-07-10 20:20:46,117 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 20:20:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2020-07-10 20:20:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:20:46,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:46,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:46,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:46,120 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1567937856, now seen corresponding path program 1 times [2020-07-10 20:20:46,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:46,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682118878] [2020-07-10 20:20:46,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:46,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1095#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1081#true} is VALID [2020-07-10 20:20:46,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1081#true} #valid := #valid[0 := 0]; {1081#true} is VALID [2020-07-10 20:20:46,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {1081#true} assume 0 < #StackHeapBarrier; {1081#true} is VALID [2020-07-10 20:20:46,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {1081#true} assume true; {1081#true} is VALID [2020-07-10 20:20:46,582 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1081#true} {1081#true} #109#return; {1081#true} is VALID [2020-07-10 20:20:46,583 INFO L263 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1095#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:46,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {1095#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1081#true} is VALID [2020-07-10 20:20:46,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {1081#true} #valid := #valid[0 := 0]; {1081#true} is VALID [2020-07-10 20:20:46,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {1081#true} assume 0 < #StackHeapBarrier; {1081#true} is VALID [2020-07-10 20:20:46,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1081#true} assume true; {1081#true} is VALID [2020-07-10 20:20:46,585 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1081#true} {1081#true} #109#return; {1081#true} is VALID [2020-07-10 20:20:46,585 INFO L263 TraceCheckUtils]: 6: Hoare triple {1081#true} call #t~ret9 := main(); {1081#true} is VALID [2020-07-10 20:20:46,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {1081#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {1081#true} is VALID [2020-07-10 20:20:46,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {1081#true} havoc ~i~0; {1081#true} is VALID [2020-07-10 20:20:46,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {1081#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1081#true} is VALID [2020-07-10 20:20:46,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {1081#true} ~num~0 := #t~nondet0; {1081#true} is VALID [2020-07-10 20:20:46,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {1081#true} havoc #t~nondet0; {1081#true} is VALID [2020-07-10 20:20:46,587 INFO L280 TraceCheckUtils]: 12: Hoare triple {1081#true} ~i~0 := 0; {1081#true} is VALID [2020-07-10 20:20:46,587 INFO L280 TraceCheckUtils]: 13: Hoare triple {1081#true} assume !!(~i~0 < ~num~0); {1081#true} is VALID [2020-07-10 20:20:46,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {1081#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1081#true} is VALID [2020-07-10 20:20:46,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {1081#true} SUMMARY for call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L18-1 {1081#true} is VALID [2020-07-10 20:20:46,588 INFO L280 TraceCheckUtils]: 16: Hoare triple {1081#true} havoc #t~nondet2; {1081#true} is VALID [2020-07-10 20:20:46,589 INFO L280 TraceCheckUtils]: 17: Hoare triple {1081#true} #t~post1 := ~i~0; {1081#true} is VALID [2020-07-10 20:20:46,589 INFO L280 TraceCheckUtils]: 18: Hoare triple {1081#true} ~i~0 := 1 + #t~post1; {1081#true} is VALID [2020-07-10 20:20:46,590 INFO L280 TraceCheckUtils]: 19: Hoare triple {1081#true} havoc #t~post1; {1081#true} is VALID [2020-07-10 20:20:46,590 INFO L280 TraceCheckUtils]: 20: Hoare triple {1081#true} assume !(~i~0 < ~num~0); {1081#true} is VALID [2020-07-10 20:20:46,590 INFO L280 TraceCheckUtils]: 21: Hoare triple {1081#true} ~i~0 := 0; {1081#true} is VALID [2020-07-10 20:20:46,591 INFO L280 TraceCheckUtils]: 22: Hoare triple {1081#true} assume !!(~i~0 < ~num~0); {1081#true} is VALID [2020-07-10 20:20:46,592 INFO L280 TraceCheckUtils]: 23: Hoare triple {1081#true} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {1088#(or (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2)))))} is VALID [2020-07-10 20:20:46,595 INFO L280 TraceCheckUtils]: 24: Hoare triple {1088#(or (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2)))))} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2); {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} is VALID [2020-07-10 20:20:46,596 INFO L280 TraceCheckUtils]: 25: Hoare triple {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} havoc #t~mem4; {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} is VALID [2020-07-10 20:20:46,597 INFO L280 TraceCheckUtils]: 26: Hoare triple {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} SUMMARY for call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L25 {1090#(<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))} is VALID [2020-07-10 20:20:46,598 INFO L263 TraceCheckUtils]: 27: Hoare triple {1090#(<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))} call printEven(#t~mem5); {1091#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} is VALID [2020-07-10 20:20:46,599 INFO L280 TraceCheckUtils]: 28: Hoare triple {1091#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} ~i := #in~i; {1092#(<= printEven_~i (* 2 (div printEven_~i 2)))} is VALID [2020-07-10 20:20:46,601 INFO L263 TraceCheckUtils]: 29: Hoare triple {1092#(<= printEven_~i (* 2 (div printEven_~i 2)))} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {1093#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:20:46,602 INFO L280 TraceCheckUtils]: 30: Hoare triple {1093#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1094#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:20:46,608 INFO L280 TraceCheckUtils]: 31: Hoare triple {1094#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1082#false} is VALID [2020-07-10 20:20:46,609 INFO L280 TraceCheckUtils]: 32: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2020-07-10 20:20:46,613 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 20:20:46,613 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:46,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682118878] [2020-07-10 20:20:46,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:46,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:20:46,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602339862] [2020-07-10 20:20:46,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-10 20:20:46,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:46,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:20:46,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:46,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:20:46,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:46,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:20:46,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:20:46,679 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2020-07-10 20:20:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,869 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 20:20:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:20:47,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-10 20:20:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:20:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-10 20:20:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:20:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-10 20:20:47,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-10 20:20:47,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:47,966 INFO L225 Difference]: With dead ends: 68 [2020-07-10 20:20:47,966 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 20:20:47,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-10 20:20:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 20:20:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-10 20:20:48,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:48,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-10 20:20:48,060 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-10 20:20:48,060 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-10 20:20:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,066 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-10 20:20:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-10 20:20:48,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:48,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:48,068 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-10 20:20:48,068 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-10 20:20:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,076 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-10 20:20:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-10 20:20:48,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:48,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:48,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:48,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 20:20:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-07-10 20:20:48,082 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 33 [2020-07-10 20:20:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:48,083 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-07-10 20:20:48,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:20:48,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2020-07-10 20:20:48,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-10 20:20:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:20:48,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:48,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:48,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:48,169 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash -741681537, now seen corresponding path program 1 times [2020-07-10 20:20:48,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:48,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280097830] [2020-07-10 20:20:48,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:48,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:20:48,200 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:20:48,207 INFO L168 Benchmark]: Toolchain (without parser) took 6206.49 ms. Allocated memory was 134.2 MB in the beginning and 299.4 MB in the end (delta: 165.2 MB). Free memory was 99.2 MB in the beginning and 202.8 MB in the end (delta: -103.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:48,208 INFO L168 Benchmark]: CDTParser took 1.21 ms. Allocated memory is still 134.2 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 20:20:48,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.04 ms. Allocated memory is still 134.2 MB. Free memory was 99.0 MB in the beginning and 88.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:48,210 INFO L168 Benchmark]: Boogie Preprocessor took 178.93 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 88.4 MB in the beginning and 178.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:48,213 INFO L168 Benchmark]: RCFGBuilder took 695.77 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 148.9 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:48,214 INFO L168 Benchmark]: TraceAbstraction took 5001.33 ms. Allocated memory was 200.3 MB in the beginning and 299.4 MB in the end (delta: 99.1 MB). Free memory was 148.2 MB in the beginning and 202.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:48,222 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 1.21 ms. Allocated memory is still 134.2 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.04 ms. Allocated memory is still 134.2 MB. Free memory was 99.0 MB in the beginning and 88.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.93 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 88.4 MB in the beginning and 178.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 695.77 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 148.9 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5001.33 ms. Allocated memory was 200.3 MB in the beginning and 299.4 MB in the end (delta: 99.1 MB). Free memory was 148.2 MB in the beginning and 202.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...