/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/array-examples/sanfoundry_24-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:50,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:50,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:50,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:50,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:50,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:50,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:50,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:50,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:50,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:50,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:50,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:50,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:50,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:50,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:50,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:50,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:50,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:50,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:50,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:50,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:50,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:50,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:50,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:50,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:50,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:50,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:50,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:50,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:50,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:50,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:50,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:50,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:50,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:50,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:50,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:50,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:50,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:50,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:50,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:50,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:50,869 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:25:50,901 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:50,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:50,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:50,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:50,904 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:50,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:50,904 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:50,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:50,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:50,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:50,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:50,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:50,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:50,907 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:50,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:50,907 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:50,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:50,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:50,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:50,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:50,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:50,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:50,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:50,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:50,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:50,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:50,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:50,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:50,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:50,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:51,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:51,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:51,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:51,250 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:51,250 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:51,251 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 15:25:51,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd607911b/f3483647a0af49d6879cecc27318dec0/FLAGa0c2e99e5 [2020-07-10 15:25:51,796 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:51,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_24-1.i [2020-07-10 15:25:51,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd607911b/f3483647a0af49d6879cecc27318dec0/FLAGa0c2e99e5 [2020-07-10 15:25:52,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd607911b/f3483647a0af49d6879cecc27318dec0 [2020-07-10 15:25:52,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:52,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:52,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:52,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:52,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:52,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430027b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52, skipping insertion in model container [2020-07-10 15:25:52,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:52,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:52,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:52,383 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:52,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:52,430 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:52,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52 WrapperNode [2020-07-10 15:25:52,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:52,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:52,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:52,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:52,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (1/1) ... [2020-07-10 15:25:52,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:52,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:52,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:52,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:52,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (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:25:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:25:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure printEven [2020-07-10 15:25:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure printOdd [2020-07-10 15:25:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:25:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:25:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure printEven [2020-07-10 15:25:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure printOdd [2020-07-10 15:25:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:25:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:25:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:53,084 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:53,084 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:25:53,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:53 BoogieIcfgContainer [2020-07-10 15:25:53,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:53,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:53,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:53,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:53,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:52" (1/3) ... [2020-07-10 15:25:53,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7725562d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:53, skipping insertion in model container [2020-07-10 15:25:53,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:52" (2/3) ... [2020-07-10 15:25:53,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7725562d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:53, skipping insertion in model container [2020-07-10 15:25:53,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:53" (3/3) ... [2020-07-10 15:25:53,098 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_24-1.i [2020-07-10 15:25:53,107 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:53,116 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:53,130 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:53,155 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:53,155 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:53,156 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:53,156 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:53,156 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:53,156 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:53,156 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:53,157 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-10 15:25:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:25:53,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:53,185 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:25:53,185 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash -762079996, now seen corresponding path program 1 times [2020-07-10 15:25:53,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:53,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092599355] [2020-07-10 15:25:53,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:53,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(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; {42#true} is VALID [2020-07-10 15:25:53,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 15:25:53,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #83#return; {42#true} is VALID [2020-07-10 15:25:53,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {50#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:53,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#(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; {42#true} is VALID [2020-07-10 15:25:53,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 15:25:53,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #83#return; {42#true} is VALID [2020-07-10 15:25:53,488 INFO L263 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret9 := main(); {42#true} is VALID [2020-07-10 15:25:53,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {47#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:53,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#(= 0 main_~i~0)} assume !(~i~0 < ~num~0); {48#(<= main_~num~0 0)} is VALID [2020-07-10 15:25:53,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#(<= main_~num~0 0)} ~i~0 := 0; {49#(and (<= main_~num~0 0) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:53,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {49#(and (<= main_~num~0 0) (= 0 main_~i~0))} assume !!(~i~0 < ~num~0);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43#false} is VALID [2020-07-10 15:25:53,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#false} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2);havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43#false} is VALID [2020-07-10 15:25:53,496 INFO L263 TraceCheckUtils]: 10: Hoare triple {43#false} call printEven(#t~mem5); {43#false} is VALID [2020-07-10 15:25:53,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#false} ~i := #in~i; {43#false} is VALID [2020-07-10 15:25:53,497 INFO L263 TraceCheckUtils]: 12: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {43#false} is VALID [2020-07-10 15:25:53,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2020-07-10 15:25:53,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2020-07-10 15:25:53,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-10 15:25:53,501 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:25:53,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092599355] [2020-07-10 15:25:53,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:53,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:25:53,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362997790] [2020-07-10 15:25:53,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:25:53,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:53,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:25:53,558 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:25:53,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:25:53,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:25:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:25:53,572 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-07-10 15:25:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:54,133 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2020-07-10 15:25:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:25:54,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:25:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2020-07-10 15:25:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2020-07-10 15:25:54,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2020-07-10 15:25:54,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:54,349 INFO L225 Difference]: With dead ends: 89 [2020-07-10 15:25:54,349 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 15:25:54,354 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 15:25:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 15:25:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2020-07-10 15:25:54,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:54,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 36 states. [2020-07-10 15:25:54,425 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 36 states. [2020-07-10 15:25:54,425 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 36 states. [2020-07-10 15:25:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:54,440 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-10 15:25:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2020-07-10 15:25:54,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:54,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:54,442 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 46 states. [2020-07-10 15:25:54,442 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 46 states. [2020-07-10 15:25:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:54,457 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-10 15:25:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2020-07-10 15:25:54,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:54,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:54,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:54,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:25:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-10 15:25:54,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2020-07-10 15:25:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:54,473 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-10 15:25:54,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:25:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:25:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:25:54,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:54,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:54,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:25:54,476 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 204295910, now seen corresponding path program 1 times [2020-07-10 15:25:54,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:54,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391873742] [2020-07-10 15:25:54,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {327#(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; {316#true} is VALID [2020-07-10 15:25:54,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2020-07-10 15:25:54,817 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #83#return; {316#true} is VALID [2020-07-10 15:25:54,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {327#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:54,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#(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; {316#true} is VALID [2020-07-10 15:25:54,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2020-07-10 15:25:54,819 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #83#return; {316#true} is VALID [2020-07-10 15:25:54,819 INFO L263 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret9 := main(); {316#true} is VALID [2020-07-10 15:25:54,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {316#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {316#true} is VALID [2020-07-10 15:25:54,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!(~i~0 < ~num~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {316#true} is VALID [2020-07-10 15:25:54,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {316#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {316#true} is VALID [2020-07-10 15:25:54,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {316#true} assume !(~i~0 < ~num~0); {316#true} is VALID [2020-07-10 15:25:54,821 INFO L280 TraceCheckUtils]: 9: Hoare triple {316#true} ~i~0 := 0; {316#true} is VALID [2020-07-10 15:25:54,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {316#true} assume !!(~i~0 < ~num~0);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {321#(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 15:25:54,825 INFO L280 TraceCheckUtils]: 11: Hoare triple {321#(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);havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {322#(<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))} is VALID [2020-07-10 15:25:54,826 INFO L263 TraceCheckUtils]: 12: Hoare triple {322#(<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))} call printEven(#t~mem5); {323#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} is VALID [2020-07-10 15:25:54,827 INFO L280 TraceCheckUtils]: 13: Hoare triple {323#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} ~i := #in~i; {324#(<= printEven_~i (* 2 (div printEven_~i 2)))} is VALID [2020-07-10 15:25:54,830 INFO L263 TraceCheckUtils]: 14: Hoare triple {324#(<= 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)); {325#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:25:54,831 INFO L280 TraceCheckUtils]: 15: Hoare triple {325#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {326#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:25:54,832 INFO L280 TraceCheckUtils]: 16: Hoare triple {326#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {317#false} is VALID [2020-07-10 15:25:54,832 INFO L280 TraceCheckUtils]: 17: Hoare triple {317#false} assume !false; {317#false} is VALID [2020-07-10 15:25:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:54,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391873742] [2020-07-10 15:25:54,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:54,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 15:25:54,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282385413] [2020-07-10 15:25:54,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-10 15:25:54,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:54,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:25:54,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:54,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:25:54,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:54,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:25:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:25:54,874 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 9 states. [2020-07-10 15:25:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,664 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-10 15:25:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:25:55,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-10 15:25:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-07-10 15:25:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-07-10 15:25:55,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2020-07-10 15:25:55,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,741 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:25:55,741 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:25:55,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:25:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:25:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 15:25:55,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:55,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 15:25:55,780 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 15:25:55,781 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 15:25:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,783 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:25:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:25:55,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,785 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 15:25:55,785 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 15:25:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,788 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:25:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:25:55,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:55,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:25:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-10 15:25:55,792 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2020-07-10 15:25:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:55,792 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-10 15:25:55,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:25:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:25:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:25:55,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:55,794 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] [2020-07-10 15:25:55,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:25:55,794 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1004823058, now seen corresponding path program 1 times [2020-07-10 15:25:55,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:55,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173517649] [2020-07-10 15:25:55,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {547#(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; {536#true} is VALID [2020-07-10 15:25:56,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {536#true} assume true; {536#true} is VALID [2020-07-10 15:25:56,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {536#true} {536#true} #83#return; {536#true} is VALID [2020-07-10 15:25:56,095 INFO L263 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {547#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:56,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {547#(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; {536#true} is VALID [2020-07-10 15:25:56,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2020-07-10 15:25:56,096 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #83#return; {536#true} is VALID [2020-07-10 15:25:56,097 INFO L263 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret9 := main(); {536#true} is VALID [2020-07-10 15:25:56,097 INFO L280 TraceCheckUtils]: 5: Hoare triple {536#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {536#true} is VALID [2020-07-10 15:25:56,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {536#true} assume !!(~i~0 < ~num~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {536#true} is VALID [2020-07-10 15:25:56,098 INFO L280 TraceCheckUtils]: 7: Hoare triple {536#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {536#true} is VALID [2020-07-10 15:25:56,098 INFO L280 TraceCheckUtils]: 8: Hoare triple {536#true} assume !(~i~0 < ~num~0); {536#true} is VALID [2020-07-10 15:25:56,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {536#true} ~i~0 := 0; {536#true} is VALID [2020-07-10 15:25:56,098 INFO L280 TraceCheckUtils]: 10: Hoare triple {536#true} assume !!(~i~0 < ~num~0);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {536#true} is VALID [2020-07-10 15:25:56,099 INFO L280 TraceCheckUtils]: 11: Hoare triple {536#true} assume !(0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2));havoc #t~mem4; {536#true} is VALID [2020-07-10 15:25:56,099 INFO L280 TraceCheckUtils]: 12: Hoare triple {536#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {536#true} is VALID [2020-07-10 15:25:56,099 INFO L280 TraceCheckUtils]: 13: Hoare triple {536#true} assume !(~i~0 < ~num~0); {536#true} is VALID [2020-07-10 15:25:56,100 INFO L280 TraceCheckUtils]: 14: Hoare triple {536#true} ~i~0 := 0; {536#true} is VALID [2020-07-10 15:25:56,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {536#true} assume !!(~i~0 < ~num~0);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {541#(= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem7|)} is VALID [2020-07-10 15:25:56,103 INFO L280 TraceCheckUtils]: 16: Hoare triple {541#(= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem7|)} assume 0 != (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2);havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {542#(<= |main_#t~mem8| (+ (* 2 (div (+ |main_#t~mem8| (- 1)) 2)) 1))} is VALID [2020-07-10 15:25:56,104 INFO L263 TraceCheckUtils]: 17: Hoare triple {542#(<= |main_#t~mem8| (+ (* 2 (div (+ |main_#t~mem8| (- 1)) 2)) 1))} call printOdd(#t~mem8); {543#(<= |printOdd_#in~i| (+ (* 2 (div (+ |printOdd_#in~i| (- 1)) 2)) 1))} is VALID [2020-07-10 15:25:56,106 INFO L280 TraceCheckUtils]: 18: Hoare triple {543#(<= |printOdd_#in~i| (+ (* 2 (div (+ |printOdd_#in~i| (- 1)) 2)) 1))} ~i := #in~i; {544#(not (= printOdd_~i (* 2 (div printOdd_~i 2))))} is VALID [2020-07-10 15:25:56,108 INFO L263 TraceCheckUtils]: 19: Hoare triple {544#(not (= printOdd_~i (* 2 (div printOdd_~i 2))))} call __VERIFIER_assert((if 0 != (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {545#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:25:56,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {545#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {546#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:25:56,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {546#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {537#false} is VALID [2020-07-10 15:25:56,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {537#false} assume !false; {537#false} is VALID [2020-07-10 15:25:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:25:56,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173517649] [2020-07-10 15:25:56,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:56,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 15:25:56,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941154049] [2020-07-10 15:25:56,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-10 15:25:56,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:25:56,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:25:56,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:25:56,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:25:56,144 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2020-07-10 15:25:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,880 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:25:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:25:56,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-10 15:25:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-10 15:25:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-10 15:25:56,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-10 15:25:56,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,959 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:25:56,960 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:25:56,961 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:25:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:25:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:25:56,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:25:56,962 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:25:56,962 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:25:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:25:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:25:56,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,963 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:25:56,963 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:25:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,964 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:25:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:25:56,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:25:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:25:56,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-10 15:25:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,965 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:25:56,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:25:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:25:56,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:25:56,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:25:57,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:25:57,134 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:25:57,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:25:57,134 INFO L271 CegarLoopResult]: At program point printOddENTRY(lines 7 9) the Hoare annotation is: true [2020-07-10 15:25:57,135 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (or (not (<= |printOdd_#in~i| (+ (* 2 (div (+ |printOdd_#in~i| (- 1)) 2)) 1))) (not (= printOdd_~i (* (div printOdd_~i 2) 2)))) [2020-07-10 15:25:57,135 INFO L268 CegarLoopResult]: For program point printOddFINAL(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:25:57,135 INFO L268 CegarLoopResult]: For program point printOddEXIT(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:25:57,135 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:25:57,135 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:25:57,135 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:25:57,135 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:25:57,135 INFO L268 CegarLoopResult]: For program point printEvenEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:25:57,135 INFO L271 CegarLoopResult]: At program point printEvenENTRY(lines 4 6) the Hoare annotation is: true [2020-07-10 15:25:57,135 INFO L268 CegarLoopResult]: For program point printEvenFINAL(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:25:57,136 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (or (not (<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))) (<= printEven_~i (* 2 (div printEven_~i 2)))) [2020-07-10 15:25:57,136 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 10 36) no Hoare annotation was computed. [2020-07-10 15:25:57,136 INFO L268 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2020-07-10 15:25:57,136 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (<= |main_#t~mem8| (+ (* 2 (div (+ |main_#t~mem8| (- 1)) 2)) 1)) [2020-07-10 15:25:57,136 INFO L268 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-07-10 15:25:57,136 INFO L268 CegarLoopResult]: For program point L28-2(lines 28 34) no Hoare annotation was computed. [2020-07-10 15:25:57,136 INFO L271 CegarLoopResult]: At program point L28-3(lines 28 34) the Hoare annotation is: true [2020-07-10 15:25:57,136 INFO L268 CegarLoopResult]: For program point L28-4(lines 28 34) no Hoare annotation was computed. [2020-07-10 15:25:57,136 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 19) no Hoare annotation was computed. [2020-07-10 15:25:57,137 INFO L271 CegarLoopResult]: At program point L16-3(lines 16 19) the Hoare annotation is: true [2020-07-10 15:25:57,137 INFO L268 CegarLoopResult]: For program point L16-4(lines 16 19) no Hoare annotation was computed. [2020-07-10 15:25:57,137 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2))) [2020-07-10 15:25:57,137 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-10 15:25:57,137 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 27) no Hoare annotation was computed. [2020-07-10 15:25:57,137 INFO L271 CegarLoopResult]: At program point L21-3(lines 21 27) the Hoare annotation is: true [2020-07-10 15:25:57,138 INFO L268 CegarLoopResult]: For program point L21-4(lines 21 27) no Hoare annotation was computed. [2020-07-10 15:25:57,138 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 10 36) no Hoare annotation was computed. [2020-07-10 15:25:57,138 INFO L268 CegarLoopResult]: For program point L30(lines 30 33) no Hoare annotation was computed. [2020-07-10 15:25:57,138 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 10 36) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:25:57,138 INFO L268 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-07-10 15:25:57,138 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2020-07-10 15:25:57,138 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2020-07-10 15:25:57,138 INFO L268 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-07-10 15:25:57,139 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-07-10 15:25:57,139 INFO L268 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-07-10 15:25:57,144 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:25:57,154 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-10 15:25:57,154 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:25:57,154 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2020-07-10 15:25:57,155 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:25:57,155 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2020-07-10 15:25:57,155 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2020-07-10 15:25:57,156 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: L3-3 has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: printOddEXIT has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: printEvenEXIT has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-10 15:25:57,157 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-10 15:25:57,158 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 15:25:57,159 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:25:57,160 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 15:25:57,160 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 15:25:57,160 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:25:57,160 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:25:57,160 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:25:57,163 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:25:57,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:25:57 BoogieIcfgContainer [2020-07-10 15:25:57,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:25:57,177 INFO L168 Benchmark]: Toolchain (without parser) took 5030.76 ms. Allocated memory was 146.3 MB in the beginning and 271.6 MB in the end (delta: 125.3 MB). Free memory was 104.0 MB in the beginning and 223.3 MB in the end (delta: -119.3 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:25:57,179 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:25:57,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.87 ms. Allocated memory is still 146.3 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:25:57,182 INFO L168 Benchmark]: Boogie Preprocessor took 136.69 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.2 MB in the beginning and 181.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:25:57,183 INFO L168 Benchmark]: RCFGBuilder took 520.44 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 156.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:25:57,184 INFO L168 Benchmark]: TraceAbstraction took 4082.26 ms. Allocated memory was 203.9 MB in the beginning and 271.6 MB in the end (delta: 67.6 MB). Free memory was 155.6 MB in the beginning and 223.3 MB in the end (delta: -67.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:25:57,190 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.87 ms. Allocated memory is still 146.3 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.69 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.2 MB in the beginning and 181.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.44 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 156.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4082.26 ms. Allocated memory was 203.9 MB in the beginning and 271.6 MB in the end (delta: 67.6 MB). Free memory was 155.6 MB in the beginning and 223.3 MB in the end (delta: -67.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 90 SDtfs, 63 SDslu, 294 SDs, 0 SdLazy, 343 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 21 PreInvPairs, 29 NumberOfFragments, 76 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 3311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3/3 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...