/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/loops/lu.cmp.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:37,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:37,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:37,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:37,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:37,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:37,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:37,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:37,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:37,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:37,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:37,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:37,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:37,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:37,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:37,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:37,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:37,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:37,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:37,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:37,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:37,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:37,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:37,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:37,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:37,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:37,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:37,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:37,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:37,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:37,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:37,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:37,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:37,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:37,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:37,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:37,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:37,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:37,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:37,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:37,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:37,154 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-08 12:45:37,178 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:37,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:37,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:37,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:37,181 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:37,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:37,181 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:37,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:37,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:37,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:37,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:37,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:37,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:37,183 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:37,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:37,183 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:37,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:37,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:37,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:37,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:37,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:37,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:37,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:37,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:37,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:37,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:37,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:37,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:37,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:37,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:37,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:37,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:37,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:37,585 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:37,585 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:37,586 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp.c [2020-07-08 12:45:37,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3241581f3/7b45221fa42d4fe08c663e1f61534574/FLAGe5375a28d [2020-07-08 12:45:38,326 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:38,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2020-07-08 12:45:38,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3241581f3/7b45221fa42d4fe08c663e1f61534574/FLAGe5375a28d [2020-07-08 12:45:38,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3241581f3/7b45221fa42d4fe08c663e1f61534574 [2020-07-08 12:45:38,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:38,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:38,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:38,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:38,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:38,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:38" (1/1) ... [2020-07-08 12:45:38,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1141d177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:38, skipping insertion in model container [2020-07-08 12:45:38,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:38" (1/1) ... [2020-07-08 12:45:38,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:38,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:38,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:38,941 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:39,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:39,149 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:39,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39 WrapperNode [2020-07-08 12:45:39,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:39,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:39,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:39,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:39,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (1/1) ... [2020-07-08 12:45:39,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:39,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:39,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:39,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:39,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (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-08 12:45:39,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:39,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:39,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2020-07-08 12:45:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2020-07-08 12:45:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2020-07-08 12:45:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2020-07-08 12:45:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 12:45:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 12:45:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:40,200 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:40,200 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-08 12:45:40,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:40 BoogieIcfgContainer [2020-07-08 12:45:40,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:40,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:40,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:40,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:40,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:38" (1/3) ... [2020-07-08 12:45:40,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289375a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:40, skipping insertion in model container [2020-07-08 12:45:40,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:39" (2/3) ... [2020-07-08 12:45:40,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289375a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:40, skipping insertion in model container [2020-07-08 12:45:40,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:40" (3/3) ... [2020-07-08 12:45:40,225 INFO L109 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2020-07-08 12:45:40,242 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:40,260 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:40,281 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:40,320 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:40,321 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:40,321 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:40,321 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:40,321 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:40,322 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:40,322 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:40,322 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-07-08 12:45:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 12:45:40,368 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:40,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:40,370 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash 406725423, now seen corresponding path program 1 times [2020-07-08 12:45:40,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:40,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975863739] [2020-07-08 12:45:40,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:40,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2020-07-08 12:45:40,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-08 12:45:40,787 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #208#return; {67#true} is VALID [2020-07-08 12:45:40,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {72#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 12:45:40,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2020-07-08 12:45:40,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-08 12:45:40,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #208#return; {67#true} is VALID [2020-07-08 12:45:40,795 INFO L263 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret33 := main(); {67#true} is VALID [2020-07-08 12:45:40,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {67#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {67#true} is VALID [2020-07-08 12:45:40,797 INFO L280 TraceCheckUtils]: 6: Hoare triple {67#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {67#true} is VALID [2020-07-08 12:45:40,799 INFO L280 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2020-07-08 12:45:40,800 INFO L263 TraceCheckUtils]: 8: Hoare triple {68#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {68#false} is VALID [2020-07-08 12:45:40,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2020-07-08 12:45:40,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2020-07-08 12:45:40,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2020-07-08 12:45:40,804 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-08 12:45:40,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975863739] [2020-07-08 12:45:40,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:40,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:40,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565349191] [2020-07-08 12:45:40,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 12:45:40,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:40,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:40,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:40,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:40,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:40,877 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-07-08 12:45:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:41,554 INFO L93 Difference]: Finished difference Result 127 states and 191 transitions. [2020-07-08 12:45:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:41,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 12:45:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-08 12:45:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-08 12:45:41,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-08 12:45:41,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:41,983 INFO L225 Difference]: With dead ends: 127 [2020-07-08 12:45:41,983 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:45:41,990 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-08 12:45:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:45:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-07-08 12:45:42,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:42,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 20 states. [2020-07-08 12:45:42,054 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 20 states. [2020-07-08 12:45:42,055 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 20 states. [2020-07-08 12:45:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,062 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:45:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:45:42,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:42,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:42,063 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 24 states. [2020-07-08 12:45:42,064 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 24 states. [2020-07-08 12:45:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,068 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:45:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:45:42,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:42,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:42,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:42,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:45:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-08 12:45:42,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2020-07-08 12:45:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:42,076 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-08 12:45:42,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-08 12:45:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 12:45:42,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:42,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:42,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:42,079 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 394719650, now seen corresponding path program 1 times [2020-07-08 12:45:42,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:42,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49685509] [2020-07-08 12:45:42,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {327#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {320#true} is VALID [2020-07-08 12:45:42,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-08 12:45:42,253 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #208#return; {320#true} is VALID [2020-07-08 12:45:42,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {327#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 12:45:42,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {320#true} is VALID [2020-07-08 12:45:42,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-08 12:45:42,258 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #208#return; {320#true} is VALID [2020-07-08 12:45:42,258 INFO L263 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret33 := main(); {320#true} is VALID [2020-07-08 12:45:42,259 INFO L280 TraceCheckUtils]: 5: Hoare triple {320#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {325#(<= 5 main_~n~0)} is VALID [2020-07-08 12:45:42,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {325#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {326#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:42,263 INFO L280 TraceCheckUtils]: 7: Hoare triple {326#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !(~j~0 <= ~n~0); {321#false} is VALID [2020-07-08 12:45:42,264 INFO L263 TraceCheckUtils]: 8: Hoare triple {321#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {321#false} is VALID [2020-07-08 12:45:42,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {321#false} ~cond := #in~cond; {321#false} is VALID [2020-07-08 12:45:42,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {321#false} assume 0 == ~cond; {321#false} is VALID [2020-07-08 12:45:42,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {321#false} assume !false; {321#false} is VALID [2020-07-08 12:45:42,267 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-08 12:45:42,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49685509] [2020-07-08 12:45:42,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:42,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:42,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859395429] [2020-07-08 12:45:42,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-08 12:45:42,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:42,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:42,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:42,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:42,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:42,297 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 5 states. [2020-07-08 12:45:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,654 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-07-08 12:45:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:45:42,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-08 12:45:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 12:45:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 12:45:42,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-08 12:45:42,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:42,748 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:45:42,748 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:45:42,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:45:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:45:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2020-07-08 12:45:42,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:42,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 21 states. [2020-07-08 12:45:42,802 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 21 states. [2020-07-08 12:45:42,802 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 21 states. [2020-07-08 12:45:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,805 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-08 12:45:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-08 12:45:42,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:42,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:42,806 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 26 states. [2020-07-08 12:45:42,807 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 26 states. [2020-07-08 12:45:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,809 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-08 12:45:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-08 12:45:42,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:42,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:42,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:42,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:45:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-08 12:45:42,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2020-07-08 12:45:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:42,813 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-08 12:45:42,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-08 12:45:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:45:42,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:42,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:42,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:42,815 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1180233829, now seen corresponding path program 1 times [2020-07-08 12:45:42,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:42,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738745097] [2020-07-08 12:45:42,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {471#true} is VALID [2020-07-08 12:45:42,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2020-07-08 12:45:42,970 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #208#return; {471#true} is VALID [2020-07-08 12:45:42,972 INFO L263 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {478#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 12:45:42,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {471#true} is VALID [2020-07-08 12:45:42,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2020-07-08 12:45:42,974 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #208#return; {471#true} is VALID [2020-07-08 12:45:42,974 INFO L263 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret33 := main(); {471#true} is VALID [2020-07-08 12:45:42,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {476#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:42,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {476#(= 0 main_~i~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {477#(and (= 0 main_~j~0) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:42,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#(and (= 0 main_~j~0) (= 0 main_~i~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {477#(and (= 0 main_~j~0) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:42,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {477#(and (= 0 main_~j~0) (= 0 main_~i~0))} assume !(~i~0 == ~j~0); {472#false} is VALID [2020-07-08 12:45:42,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {472#false} is VALID [2020-07-08 12:45:42,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {472#false} is VALID [2020-07-08 12:45:42,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {472#false} assume !(~j~0 <= ~n~0); {472#false} is VALID [2020-07-08 12:45:42,981 INFO L263 TraceCheckUtils]: 12: Hoare triple {472#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {472#false} is VALID [2020-07-08 12:45:42,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2020-07-08 12:45:42,981 INFO L280 TraceCheckUtils]: 14: Hoare triple {472#false} assume 0 == ~cond; {472#false} is VALID [2020-07-08 12:45:42,982 INFO L280 TraceCheckUtils]: 15: Hoare triple {472#false} assume !false; {472#false} is VALID [2020-07-08 12:45:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:42,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738745097] [2020-07-08 12:45:42,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:42,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:42,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052387983] [2020-07-08 12:45:42,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:45:42,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:42,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:43,012 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-08 12:45:43,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:43,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:43,013 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2020-07-08 12:45:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,372 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-08 12:45:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:45:43,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:45:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2020-07-08 12:45:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2020-07-08 12:45:43,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2020-07-08 12:45:43,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:43,451 INFO L225 Difference]: With dead ends: 48 [2020-07-08 12:45:43,452 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:45:43,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:45:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:45:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-07-08 12:45:43,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:43,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 24 states. [2020-07-08 12:45:43,499 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 24 states. [2020-07-08 12:45:43,500 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 24 states. [2020-07-08 12:45:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,503 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-08 12:45:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-08 12:45:43,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:43,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:43,504 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 33 states. [2020-07-08 12:45:43,504 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 33 states. [2020-07-08 12:45:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,507 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-08 12:45:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-08 12:45:43,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:43,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:43,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:43,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:45:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-08 12:45:43,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2020-07-08 12:45:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:43,511 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-08 12:45:43,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-08 12:45:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:45:43,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:43,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:43,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:45:43,512 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash -370887203, now seen corresponding path program 1 times [2020-07-08 12:45:43,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:43,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632710828] [2020-07-08 12:45:43,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:43,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {660#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {652#true} is VALID [2020-07-08 12:45:43,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#true} assume true; {652#true} is VALID [2020-07-08 12:45:43,726 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {652#true} {652#true} #208#return; {652#true} is VALID [2020-07-08 12:45:43,728 INFO L263 TraceCheckUtils]: 0: Hoare triple {652#true} call ULTIMATE.init(); {660#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 12:45:43,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {652#true} is VALID [2020-07-08 12:45:43,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {652#true} assume true; {652#true} is VALID [2020-07-08 12:45:43,729 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} #208#return; {652#true} is VALID [2020-07-08 12:45:43,729 INFO L263 TraceCheckUtils]: 4: Hoare triple {652#true} call #t~ret33 := main(); {652#true} is VALID [2020-07-08 12:45:43,731 INFO L280 TraceCheckUtils]: 5: Hoare triple {652#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {657#(= 0 main_~i~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {657#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {657#(= 0 main_~i~0)} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {657#(= 0 main_~i~0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {657#(= 0 main_~i~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {657#(= 0 main_~i~0)} assume !(~j~0 <= ~n~0); {657#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:43,742 INFO L263 TraceCheckUtils]: 12: Hoare triple {657#(= 0 main_~i~0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {658#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:43,743 INFO L280 TraceCheckUtils]: 13: Hoare triple {658#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {659#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:43,744 INFO L280 TraceCheckUtils]: 14: Hoare triple {659#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {653#false} is VALID [2020-07-08 12:45:43,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {653#false} assume !false; {653#false} is VALID [2020-07-08 12:45:43,746 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-08 12:45:43,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632710828] [2020-07-08 12:45:43,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:43,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:45:43,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766463123] [2020-07-08 12:45:43,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:45:43,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:43,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:45:43,780 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-08 12:45:43,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:45:43,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:45:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:45:43,783 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2020-07-08 12:45:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:44,354 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-08 12:45:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:45:44,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:45:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:45:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-08 12:45:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:45:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-08 12:45:44,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2020-07-08 12:45:44,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:44,428 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:45:44,429 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:45:44,430 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:45:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:45:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-07-08 12:45:44,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:44,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2020-07-08 12:45:44,492 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2020-07-08 12:45:44,492 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2020-07-08 12:45:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:44,495 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:45:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:45:44,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:44,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:44,497 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2020-07-08 12:45:44,497 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2020-07-08 12:45:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:44,499 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:45:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:45:44,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:44,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:44,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:44,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:45:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-08 12:45:44,503 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2020-07-08 12:45:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:44,503 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-08 12:45:44,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:45:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 12:45:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:45:44,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:44,506 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:44,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:45:44,506 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash 442817577, now seen corresponding path program 1 times [2020-07-08 12:45:44,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:44,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57494455] [2020-07-08 12:45:44,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {851#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {839#true} is VALID [2020-07-08 12:45:44,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {839#true} assume true; {839#true} is VALID [2020-07-08 12:45:44,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {839#true} {839#true} #208#return; {839#true} is VALID [2020-07-08 12:45:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {839#true} ~cond := #in~cond; {839#true} is VALID [2020-07-08 12:45:44,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {839#true} assume !(0 == ~cond); {839#true} is VALID [2020-07-08 12:45:44,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {839#true} assume true; {839#true} is VALID [2020-07-08 12:45:44,653 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {839#true} {840#false} #212#return; {840#false} is VALID [2020-07-08 12:45:44,655 INFO L263 TraceCheckUtils]: 0: Hoare triple {839#true} call ULTIMATE.init(); {851#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 12:45:44,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {851#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {839#true} is VALID [2020-07-08 12:45:44,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {839#true} assume true; {839#true} is VALID [2020-07-08 12:45:44,657 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {839#true} {839#true} #208#return; {839#true} is VALID [2020-07-08 12:45:44,657 INFO L263 TraceCheckUtils]: 4: Hoare triple {839#true} call #t~ret33 := main(); {839#true} is VALID [2020-07-08 12:45:44,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {839#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {844#(<= 5 main_~n~0)} is VALID [2020-07-08 12:45:44,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {844#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:44,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:44,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:44,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:44,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {845#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {846#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 12:45:44,664 INFO L280 TraceCheckUtils]: 11: Hoare triple {846#(<= (+ main_~j~0 4) main_~n~0)} assume !(~j~0 <= ~n~0); {840#false} is VALID [2020-07-08 12:45:44,665 INFO L263 TraceCheckUtils]: 12: Hoare triple {840#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {839#true} is VALID [2020-07-08 12:45:44,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {839#true} ~cond := #in~cond; {839#true} is VALID [2020-07-08 12:45:44,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {839#true} assume !(0 == ~cond); {839#true} is VALID [2020-07-08 12:45:44,666 INFO L280 TraceCheckUtils]: 15: Hoare triple {839#true} assume true; {839#true} is VALID [2020-07-08 12:45:44,666 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {839#true} {840#false} #212#return; {840#false} is VALID [2020-07-08 12:45:44,666 INFO L280 TraceCheckUtils]: 17: Hoare triple {840#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {840#false} is VALID [2020-07-08 12:45:44,667 INFO L280 TraceCheckUtils]: 18: Hoare triple {840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {840#false} is VALID [2020-07-08 12:45:44,667 INFO L280 TraceCheckUtils]: 19: Hoare triple {840#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {840#false} is VALID [2020-07-08 12:45:44,667 INFO L280 TraceCheckUtils]: 20: Hoare triple {840#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {840#false} is VALID [2020-07-08 12:45:44,668 INFO L280 TraceCheckUtils]: 21: Hoare triple {840#false} assume !(~i~0 == ~j~0); {840#false} is VALID [2020-07-08 12:45:44,668 INFO L280 TraceCheckUtils]: 22: Hoare triple {840#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {840#false} is VALID [2020-07-08 12:45:44,668 INFO L280 TraceCheckUtils]: 23: Hoare triple {840#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {840#false} is VALID [2020-07-08 12:45:44,668 INFO L280 TraceCheckUtils]: 24: Hoare triple {840#false} assume !(~j~0 <= ~n~0); {840#false} is VALID [2020-07-08 12:45:44,669 INFO L263 TraceCheckUtils]: 25: Hoare triple {840#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {840#false} is VALID [2020-07-08 12:45:44,669 INFO L280 TraceCheckUtils]: 26: Hoare triple {840#false} ~cond := #in~cond; {840#false} is VALID [2020-07-08 12:45:44,669 INFO L280 TraceCheckUtils]: 27: Hoare triple {840#false} assume 0 == ~cond; {840#false} is VALID [2020-07-08 12:45:44,670 INFO L280 TraceCheckUtils]: 28: Hoare triple {840#false} assume !false; {840#false} is VALID [2020-07-08 12:45:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:45:44,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57494455] [2020-07-08 12:45:44,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627032842] [2020-07-08 12:45:44,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:45:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:44,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {839#true} call ULTIMATE.init(); {839#true} is VALID [2020-07-08 12:45:44,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {839#true} is VALID [2020-07-08 12:45:44,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {839#true} assume true; {839#true} is VALID [2020-07-08 12:45:44,910 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {839#true} {839#true} #208#return; {839#true} is VALID [2020-07-08 12:45:44,910 INFO L263 TraceCheckUtils]: 4: Hoare triple {839#true} call #t~ret33 := main(); {839#true} is VALID [2020-07-08 12:45:44,911 INFO L280 TraceCheckUtils]: 5: Hoare triple {839#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {844#(<= 5 main_~n~0)} is VALID [2020-07-08 12:45:44,912 INFO L280 TraceCheckUtils]: 6: Hoare triple {844#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2020-07-08 12:45:44,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2020-07-08 12:45:44,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2020-07-08 12:45:44,916 INFO L280 TraceCheckUtils]: 9: Hoare triple {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2020-07-08 12:45:44,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {886#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2020-07-08 12:45:44,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {886#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume !(~j~0 <= ~n~0); {840#false} is VALID [2020-07-08 12:45:44,919 INFO L263 TraceCheckUtils]: 12: Hoare triple {840#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {840#false} is VALID [2020-07-08 12:45:44,919 INFO L280 TraceCheckUtils]: 13: Hoare triple {840#false} ~cond := #in~cond; {840#false} is VALID [2020-07-08 12:45:44,919 INFO L280 TraceCheckUtils]: 14: Hoare triple {840#false} assume !(0 == ~cond); {840#false} is VALID [2020-07-08 12:45:44,920 INFO L280 TraceCheckUtils]: 15: Hoare triple {840#false} assume true; {840#false} is VALID [2020-07-08 12:45:44,920 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {840#false} {840#false} #212#return; {840#false} is VALID [2020-07-08 12:45:44,920 INFO L280 TraceCheckUtils]: 17: Hoare triple {840#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {840#false} is VALID [2020-07-08 12:45:44,921 INFO L280 TraceCheckUtils]: 18: Hoare triple {840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {840#false} is VALID [2020-07-08 12:45:44,921 INFO L280 TraceCheckUtils]: 19: Hoare triple {840#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {840#false} is VALID [2020-07-08 12:45:44,921 INFO L280 TraceCheckUtils]: 20: Hoare triple {840#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {840#false} is VALID [2020-07-08 12:45:44,922 INFO L280 TraceCheckUtils]: 21: Hoare triple {840#false} assume !(~i~0 == ~j~0); {840#false} is VALID [2020-07-08 12:45:44,922 INFO L280 TraceCheckUtils]: 22: Hoare triple {840#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {840#false} is VALID [2020-07-08 12:45:44,922 INFO L280 TraceCheckUtils]: 23: Hoare triple {840#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {840#false} is VALID [2020-07-08 12:45:44,923 INFO L280 TraceCheckUtils]: 24: Hoare triple {840#false} assume !(~j~0 <= ~n~0); {840#false} is VALID [2020-07-08 12:45:44,923 INFO L263 TraceCheckUtils]: 25: Hoare triple {840#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {840#false} is VALID [2020-07-08 12:45:44,923 INFO L280 TraceCheckUtils]: 26: Hoare triple {840#false} ~cond := #in~cond; {840#false} is VALID [2020-07-08 12:45:44,923 INFO L280 TraceCheckUtils]: 27: Hoare triple {840#false} assume 0 == ~cond; {840#false} is VALID [2020-07-08 12:45:44,924 INFO L280 TraceCheckUtils]: 28: Hoare triple {840#false} assume !false; {840#false} is VALID [2020-07-08 12:45:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:45:44,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:44,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-07-08 12:45:44,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154179735] [2020-07-08 12:45:44,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-08 12:45:44,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:44,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:45:44,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:44,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:45:44,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:45:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:45:44,996 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2020-07-08 12:45:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:45,468 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2020-07-08 12:45:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:45:45,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-08 12:45:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-08 12:45:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-08 12:45:45,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2020-07-08 12:45:45,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:45,571 INFO L225 Difference]: With dead ends: 66 [2020-07-08 12:45:45,571 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 12:45:45,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:45:45,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 12:45:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2020-07-08 12:45:45,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:45,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 40 states. [2020-07-08 12:45:45,685 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 40 states. [2020-07-08 12:45:45,685 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 40 states. [2020-07-08 12:45:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:45,688 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-08 12:45:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-08 12:45:45,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:45,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:45,690 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 46 states. [2020-07-08 12:45:45,690 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 46 states. [2020-07-08 12:45:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:45,692 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-08 12:45:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-08 12:45:45,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:45,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:45,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:45,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 12:45:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-07-08 12:45:45,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 29 [2020-07-08 12:45:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:45,698 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-07-08 12:45:45,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:45:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-08 12:45:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:45:45,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:45,700 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:45,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:45,916 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1798981815, now seen corresponding path program 2 times [2020-07-08 12:45:45,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:45,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658231450] [2020-07-08 12:45:45,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:46,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {1194#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1181#true} is VALID [2020-07-08 12:45:46,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {1181#true} assume true; {1181#true} is VALID [2020-07-08 12:45:46,085 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1181#true} {1181#true} #208#return; {1181#true} is VALID [2020-07-08 12:45:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:46,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {1181#true} ~cond := #in~cond; {1181#true} is VALID [2020-07-08 12:45:46,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {1181#true} assume !(0 == ~cond); {1181#true} is VALID [2020-07-08 12:45:46,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2020-07-08 12:45:46,092 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1182#false} #212#return; {1182#false} is VALID [2020-07-08 12:45:46,094 INFO L263 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1194#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 12:45:46,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {1194#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1181#true} is VALID [2020-07-08 12:45:46,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2020-07-08 12:45:46,095 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #208#return; {1181#true} is VALID [2020-07-08 12:45:46,096 INFO L263 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret33 := main(); {1181#true} is VALID [2020-07-08 12:45:46,097 INFO L280 TraceCheckUtils]: 5: Hoare triple {1181#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1186#(<= 5 main_~n~0)} is VALID [2020-07-08 12:45:46,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {1186#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:46,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:46,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:46,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:46,103 INFO L280 TraceCheckUtils]: 10: Hoare triple {1187#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1188#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 12:45:46,104 INFO L280 TraceCheckUtils]: 11: Hoare triple {1188#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1188#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 12:45:46,104 INFO L280 TraceCheckUtils]: 12: Hoare triple {1188#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {1188#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 12:45:46,105 INFO L280 TraceCheckUtils]: 13: Hoare triple {1188#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1188#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 12:45:46,106 INFO L280 TraceCheckUtils]: 14: Hoare triple {1188#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1189#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 12:45:46,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {1189#(<= (+ main_~j~0 3) main_~n~0)} assume !(~j~0 <= ~n~0); {1182#false} is VALID [2020-07-08 12:45:46,107 INFO L263 TraceCheckUtils]: 16: Hoare triple {1182#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1181#true} is VALID [2020-07-08 12:45:46,107 INFO L280 TraceCheckUtils]: 17: Hoare triple {1181#true} ~cond := #in~cond; {1181#true} is VALID [2020-07-08 12:45:46,107 INFO L280 TraceCheckUtils]: 18: Hoare triple {1181#true} assume !(0 == ~cond); {1181#true} is VALID [2020-07-08 12:45:46,108 INFO L280 TraceCheckUtils]: 19: Hoare triple {1181#true} assume true; {1181#true} is VALID [2020-07-08 12:45:46,108 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1181#true} {1182#false} #212#return; {1182#false} is VALID [2020-07-08 12:45:46,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {1182#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1182#false} is VALID [2020-07-08 12:45:46,109 INFO L280 TraceCheckUtils]: 22: Hoare triple {1182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1182#false} is VALID [2020-07-08 12:45:46,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {1182#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1182#false} is VALID [2020-07-08 12:45:46,109 INFO L280 TraceCheckUtils]: 24: Hoare triple {1182#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1182#false} is VALID [2020-07-08 12:45:46,109 INFO L280 TraceCheckUtils]: 25: Hoare triple {1182#false} assume !(~i~0 == ~j~0); {1182#false} is VALID [2020-07-08 12:45:46,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {1182#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1182#false} is VALID [2020-07-08 12:45:46,110 INFO L280 TraceCheckUtils]: 27: Hoare triple {1182#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1182#false} is VALID [2020-07-08 12:45:46,110 INFO L280 TraceCheckUtils]: 28: Hoare triple {1182#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1182#false} is VALID [2020-07-08 12:45:46,111 INFO L280 TraceCheckUtils]: 29: Hoare triple {1182#false} assume !(~i~0 == ~j~0); {1182#false} is VALID [2020-07-08 12:45:46,111 INFO L280 TraceCheckUtils]: 30: Hoare triple {1182#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1182#false} is VALID [2020-07-08 12:45:46,111 INFO L280 TraceCheckUtils]: 31: Hoare triple {1182#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1182#false} is VALID [2020-07-08 12:45:46,111 INFO L280 TraceCheckUtils]: 32: Hoare triple {1182#false} assume !(~j~0 <= ~n~0); {1182#false} is VALID [2020-07-08 12:45:46,112 INFO L263 TraceCheckUtils]: 33: Hoare triple {1182#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1182#false} is VALID [2020-07-08 12:45:46,112 INFO L280 TraceCheckUtils]: 34: Hoare triple {1182#false} ~cond := #in~cond; {1182#false} is VALID [2020-07-08 12:45:46,112 INFO L280 TraceCheckUtils]: 35: Hoare triple {1182#false} assume 0 == ~cond; {1182#false} is VALID [2020-07-08 12:45:46,112 INFO L280 TraceCheckUtils]: 36: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2020-07-08 12:45:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:45:46,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658231450] [2020-07-08 12:45:46,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141549691] [2020-07-08 12:45:46,116 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:46,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:45:46,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:46,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:45:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:46,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:46,297 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:46,358 INFO L263 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1181#true} is VALID [2020-07-08 12:45:46,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {1181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1181#true} is VALID [2020-07-08 12:45:46,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2020-07-08 12:45:46,359 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #208#return; {1181#true} is VALID [2020-07-08 12:45:46,360 INFO L263 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret33 := main(); {1181#true} is VALID [2020-07-08 12:45:46,361 INFO L280 TraceCheckUtils]: 5: Hoare triple {1181#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {1213#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {1213#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {1213#(<= main_~n~0 5)} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,364 INFO L280 TraceCheckUtils]: 9: Hoare triple {1213#(<= main_~n~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,365 INFO L280 TraceCheckUtils]: 10: Hoare triple {1213#(<= main_~n~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,367 INFO L280 TraceCheckUtils]: 11: Hoare triple {1213#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,369 INFO L280 TraceCheckUtils]: 12: Hoare triple {1213#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,369 INFO L280 TraceCheckUtils]: 13: Hoare triple {1213#(<= main_~n~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,370 INFO L280 TraceCheckUtils]: 14: Hoare triple {1213#(<= main_~n~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,376 INFO L280 TraceCheckUtils]: 15: Hoare triple {1213#(<= main_~n~0 5)} assume !(~j~0 <= ~n~0); {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,377 INFO L263 TraceCheckUtils]: 16: Hoare triple {1213#(<= main_~n~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1181#true} is VALID [2020-07-08 12:45:46,377 INFO L280 TraceCheckUtils]: 17: Hoare triple {1181#true} ~cond := #in~cond; {1181#true} is VALID [2020-07-08 12:45:46,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {1181#true} assume !(0 == ~cond); {1181#true} is VALID [2020-07-08 12:45:46,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {1181#true} assume true; {1181#true} is VALID [2020-07-08 12:45:46,378 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1181#true} {1213#(<= main_~n~0 5)} #212#return; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,379 INFO L280 TraceCheckUtils]: 21: Hoare triple {1213#(<= main_~n~0 5)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,382 INFO L280 TraceCheckUtils]: 22: Hoare triple {1213#(<= main_~n~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1213#(<= main_~n~0 5)} is VALID [2020-07-08 12:45:46,383 INFO L280 TraceCheckUtils]: 23: Hoare triple {1213#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,391 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,392 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,393 INFO L280 TraceCheckUtils]: 26: Hoare triple {1268#(<= main_~i~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,393 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#(<= main_~i~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,394 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,395 INFO L280 TraceCheckUtils]: 29: Hoare triple {1268#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,397 INFO L280 TraceCheckUtils]: 30: Hoare triple {1268#(<= main_~i~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,397 INFO L280 TraceCheckUtils]: 31: Hoare triple {1268#(<= main_~i~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,398 INFO L280 TraceCheckUtils]: 32: Hoare triple {1268#(<= main_~i~0 5)} assume !(~j~0 <= ~n~0); {1268#(<= main_~i~0 5)} is VALID [2020-07-08 12:45:46,401 INFO L263 TraceCheckUtils]: 33: Hoare triple {1268#(<= main_~i~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:45:46,402 INFO L280 TraceCheckUtils]: 34: Hoare triple {1299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:45:46,403 INFO L280 TraceCheckUtils]: 35: Hoare triple {1303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1182#false} is VALID [2020-07-08 12:45:46,403 INFO L280 TraceCheckUtils]: 36: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2020-07-08 12:45:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-08 12:45:46,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:46,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-08 12:45:46,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28310101] [2020-07-08 12:45:46,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 12:45:46,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:46,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:45:46,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:46,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:45:46,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:45:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:45:46,481 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 11 states. [2020-07-08 12:45:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:47,373 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2020-07-08 12:45:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:45:47,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 12:45:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:45:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2020-07-08 12:45:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:45:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2020-07-08 12:45:47,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2020-07-08 12:45:47,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:47,464 INFO L225 Difference]: With dead ends: 76 [2020-07-08 12:45:47,465 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:45:47,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:45:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:45:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:45:47,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:47,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:45:47,469 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:45:47,469 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:45:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:47,469 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:45:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:45:47,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:47,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:47,470 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:45:47,470 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:45:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:47,470 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:45:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:45:47,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:47,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:47,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:47,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:45:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:45:47,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-07-08 12:45:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:47,471 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:45:47,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:45:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:45:47,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:47,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:47,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:45:48,009 INFO L271 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: true [2020-07-08 12:45:48,009 INFO L268 CegarLoopResult]: For program point L118-1(line 118) no Hoare annotation was computed. [2020-07-08 12:45:48,009 INFO L268 CegarLoopResult]: For program point L127-2(lines 127 133) no Hoare annotation was computed. [2020-07-08 12:45:48,009 INFO L271 CegarLoopResult]: At program point L127-3(lines 127 133) the Hoare annotation is: true [2020-07-08 12:45:48,009 INFO L268 CegarLoopResult]: For program point L119-2(lines 119 126) no Hoare annotation was computed. [2020-07-08 12:45:48,010 INFO L271 CegarLoopResult]: At program point L119-3(lines 119 126) the Hoare annotation is: true [2020-07-08 12:45:48,010 INFO L268 CegarLoopResult]: For program point L119-4(lines 119 126) no Hoare annotation was computed. [2020-07-08 12:45:48,010 INFO L268 CegarLoopResult]: For program point L144-2(lines 144 150) no Hoare annotation was computed. [2020-07-08 12:45:48,010 INFO L271 CegarLoopResult]: At program point L144-3(lines 144 150) the Hoare annotation is: true [2020-07-08 12:45:48,010 INFO L268 CegarLoopResult]: For program point L144-4(lines 144 150) no Hoare annotation was computed. [2020-07-08 12:45:48,010 INFO L268 CegarLoopResult]: For program point L136-2(lines 136 142) no Hoare annotation was computed. [2020-07-08 12:45:48,010 INFO L271 CegarLoopResult]: At program point L136-3(lines 136 142) the Hoare annotation is: true [2020-07-08 12:45:48,010 INFO L268 CegarLoopResult]: For program point L136-4(lines 136 142) no Hoare annotation was computed. [2020-07-08 12:45:48,011 INFO L268 CegarLoopResult]: For program point ludcmpEXIT(lines 109 153) no Hoare annotation was computed. [2020-07-08 12:45:48,011 INFO L264 CegarLoopResult]: At program point ludcmpENTRY(lines 109 153) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 12:45:48,011 INFO L268 CegarLoopResult]: For program point ludcmpFINAL(lines 109 153) no Hoare annotation was computed. [2020-07-08 12:45:48,011 INFO L268 CegarLoopResult]: For program point L130-2(lines 130 131) no Hoare annotation was computed. [2020-07-08 12:45:48,011 INFO L271 CegarLoopResult]: At program point L130-3(lines 130 131) the Hoare annotation is: true [2020-07-08 12:45:48,011 INFO L268 CegarLoopResult]: For program point L130-4(lines 130 131) no Hoare annotation was computed. [2020-07-08 12:45:48,011 INFO L268 CegarLoopResult]: For program point L122(lines 122 124) no Hoare annotation was computed. [2020-07-08 12:45:48,011 INFO L268 CegarLoopResult]: For program point L122-1(lines 122 124) no Hoare annotation was computed. [2020-07-08 12:45:48,012 INFO L268 CegarLoopResult]: For program point L147-2(lines 147 148) no Hoare annotation was computed. [2020-07-08 12:45:48,012 INFO L271 CegarLoopResult]: At program point L147-3(lines 147 148) the Hoare annotation is: true [2020-07-08 12:45:48,012 INFO L268 CegarLoopResult]: For program point L147-4(lines 147 148) no Hoare annotation was computed. [2020-07-08 12:45:48,012 INFO L268 CegarLoopResult]: For program point L139-2(lines 139 140) no Hoare annotation was computed. [2020-07-08 12:45:48,012 INFO L271 CegarLoopResult]: At program point L139-3(lines 139 140) the Hoare annotation is: true [2020-07-08 12:45:48,012 INFO L268 CegarLoopResult]: For program point L139-4(lines 139 140) no Hoare annotation was computed. [2020-07-08 12:45:48,012 INFO L268 CegarLoopResult]: For program point L123-2(lines 123 124) no Hoare annotation was computed. [2020-07-08 12:45:48,013 INFO L271 CegarLoopResult]: At program point L123-3(lines 123 124) the Hoare annotation is: true [2020-07-08 12:45:48,013 INFO L268 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2020-07-08 12:45:48,013 INFO L268 CegarLoopResult]: For program point L116-2(lines 116 134) no Hoare annotation was computed. [2020-07-08 12:45:48,013 INFO L271 CegarLoopResult]: At program point L116-3(lines 116 134) the Hoare annotation is: true [2020-07-08 12:45:48,013 INFO L268 CegarLoopResult]: For program point L116-4(lines 116 134) no Hoare annotation was computed. [2020-07-08 12:45:48,013 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:45:48,013 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|)) [2020-07-08 12:45:48,013 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:45:48,014 INFO L268 CegarLoopResult]: For program point L78(lines 78 79) no Hoare annotation was computed. [2020-07-08 12:45:48,014 INFO L268 CegarLoopResult]: For program point L78-2(lines 78 79) no Hoare annotation was computed. [2020-07-08 12:45:48,014 INFO L268 CegarLoopResult]: For program point fabsEXIT(lines 74 81) no Hoare annotation was computed. [2020-07-08 12:45:48,014 INFO L271 CegarLoopResult]: At program point fabsENTRY(lines 74 81) the Hoare annotation is: true [2020-07-08 12:45:48,014 INFO L268 CegarLoopResult]: For program point fabsFINAL(lines 74 81) no Hoare annotation was computed. [2020-07-08 12:45:48,014 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:45:48,015 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:45:48,015 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:45:48,015 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:45:48,015 INFO L268 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2020-07-08 12:45:48,015 INFO L268 CegarLoopResult]: For program point L97-2(line 97) no Hoare annotation was computed. [2020-07-08 12:45:48,015 INFO L268 CegarLoopResult]: For program point L91-2(lines 91 102) no Hoare annotation was computed. [2020-07-08 12:45:48,015 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 83 107) no Hoare annotation was computed. [2020-07-08 12:45:48,016 INFO L264 CegarLoopResult]: At program point L91-3(lines 91 102) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0)) [2020-07-08 12:45:48,016 INFO L271 CegarLoopResult]: At program point L91-4(lines 91 102) the Hoare annotation is: true [2020-07-08 12:45:48,016 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 83 107) no Hoare annotation was computed. [2020-07-08 12:45:48,016 INFO L268 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-07-08 12:45:48,016 INFO L268 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2020-07-08 12:45:48,017 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 83 107) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 12:45:48,017 INFO L268 CegarLoopResult]: For program point L94-2(lines 94 99) no Hoare annotation was computed. [2020-07-08 12:45:48,017 INFO L264 CegarLoopResult]: At program point L94-3(lines 94 99) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 12:45:48,017 INFO L264 CegarLoopResult]: At program point L94-4(lines 94 99) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 12:45:48,017 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-08 12:45:48,017 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:45:48,017 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:45:48,018 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:45:48,018 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-08 12:45:48,018 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:45:48,023 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-08 12:45:48,023 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:48,024 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-08 12:45:48,026 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:45:48,026 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-08 12:45:48,026 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-08 12:45:48,026 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:48,026 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-08 12:45:48,027 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-08 12:45:48,027 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:48,029 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: L116-4 has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: L116-4 has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2020-07-08 12:45:48,030 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:48,031 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2020-07-08 12:45:48,033 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-08 12:45:48,034 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:45:48,034 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:45:48,034 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:45:48,034 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2020-07-08 12:45:48,034 WARN L170 areAnnotationChecker]: L116-4 has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:48,035 WARN L170 areAnnotationChecker]: L136-4 has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: L136-4 has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: L97-2 has no Hoare annotation [2020-07-08 12:45:48,036 WARN L170 areAnnotationChecker]: L136-4 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L139-4 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L139-4 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L139-2 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L119-4 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L119-4 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:48,037 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L94-2 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L144-4 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L144-4 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L139-4 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L139-2 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L119-4 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-08 12:45:48,038 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L144-4 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L147-4 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L147-4 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L147-2 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-08 12:45:48,039 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L147-4 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L147-2 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L130-4 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L130-4 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2020-07-08 12:45:48,040 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2020-07-08 12:45:48,041 WARN L170 areAnnotationChecker]: L119-2 has no Hoare annotation [2020-07-08 12:45:48,041 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2020-07-08 12:45:48,041 WARN L170 areAnnotationChecker]: L130-4 has no Hoare annotation [2020-07-08 12:45:48,041 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2020-07-08 12:45:48,041 WARN L170 areAnnotationChecker]: L127-2 has no Hoare annotation [2020-07-08 12:45:48,041 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:45:48,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:48 BoogieIcfgContainer [2020-07-08 12:45:48,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:48,059 INFO L168 Benchmark]: Toolchain (without parser) took 9451.09 ms. Allocated memory was 143.1 MB in the beginning and 320.3 MB in the end (delta: 177.2 MB). Free memory was 100.7 MB in the beginning and 183.9 MB in the end (delta: -83.2 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:48,060 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:48,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.67 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 100.3 MB in the beginning and 179.5 MB in the end (delta: -79.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:48,061 INFO L168 Benchmark]: Boogie Preprocessor took 84.02 ms. Allocated memory is still 201.3 MB. Free memory was 179.5 MB in the beginning and 176.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:48,062 INFO L168 Benchmark]: RCFGBuilder took 973.21 ms. Allocated memory is still 201.3 MB. Free memory was 176.2 MB in the beginning and 127.9 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:48,063 INFO L168 Benchmark]: TraceAbstraction took 7843.71 ms. Allocated memory was 201.3 MB in the beginning and 320.3 MB in the end (delta: 119.0 MB). Free memory was 127.2 MB in the beginning and 183.9 MB in the end (delta: -56.8 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:48,067 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.32 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 540.67 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 100.3 MB in the beginning and 179.5 MB in the end (delta: -79.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.02 ms. Allocated memory is still 201.3 MB. Free memory was 179.5 MB in the beginning and 176.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 973.21 ms. Allocated memory is still 201.3 MB. Free memory was 176.2 MB in the beginning and 127.9 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7843.71 ms. Allocated memory was 201.3 MB in the beginning and 320.3 MB in the end (delta: 119.0 MB). Free memory was 127.2 MB in the beginning and 183.9 MB in the end (delta: -56.8 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (n <= 5 && 5 <= n) && i <= 5 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: n <= 5 && 5 <= n - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 142 SDtfs, 143 SDslu, 120 SDs, 0 SdLazy, 348 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 52 PreInvPairs, 86 NumberOfFragments, 96 HoareAnnotationTreeSize, 52 FomulaSimplifications, 475 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 172 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 188 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 14542 SizeOfPredicates, 5 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 72/102 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...