/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/reducercommutativity/rangesum.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:52,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:52,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:52,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:52,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:52,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:52,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:52,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:52,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:52,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:52,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:52,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:52,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:52,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:52,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:52,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:52,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:52,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:52,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:52,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:52,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:52,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:52,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:52,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:52,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:52,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:52,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:52,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:52,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:52,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:52,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:52,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:52,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:52,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:52,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:52,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:52,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:52,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:52,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:52,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:52,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:52,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:25:52,330 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:52,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:52,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:52,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:52,333 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:52,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:52,333 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:52,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:52,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:52,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:52,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:52,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:52,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:52,335 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:52,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:52,335 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:52,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:52,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:52,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:52,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:52,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:52,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:52,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:52,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:52,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:52,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:52,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:52,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:52,338 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:52,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:52,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:52,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:52,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:52,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:52,671 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:52,672 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum.i [2020-07-10 15:25:52,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4118eba/24a1f1f735834171b780d9fed4b0199e/FLAG88587ecf1 [2020-07-10 15:25:53,274 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:53,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i [2020-07-10 15:25:53,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4118eba/24a1f1f735834171b780d9fed4b0199e/FLAG88587ecf1 [2020-07-10 15:25:53,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4118eba/24a1f1f735834171b780d9fed4b0199e [2020-07-10 15:25:53,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:53,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:53,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:53,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:53,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:53,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:53,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1b6256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53, skipping insertion in model container [2020-07-10 15:25:53,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:53,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:53,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:53,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:53,868 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:53,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:53,914 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:53,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53 WrapperNode [2020-07-10 15:25:53,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:53,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:53,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:53,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:54,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:54,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:54,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:54,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:54,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:54,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:54,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:54,129 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2020-07-10 15:25:54,129 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2020-07-10 15:25:54,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:25:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2020-07-10 15:25:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:25:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2020-07-10 15:25:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:25:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:54,670 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:54,671 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:25:54,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:54 BoogieIcfgContainer [2020-07-10 15:25:54,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:54,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:54,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:54,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:54,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:53" (1/3) ... [2020-07-10 15:25:54,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d58a2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (2/3) ... [2020-07-10 15:25:54,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d58a2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:54" (3/3) ... [2020-07-10 15:25:54,684 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum.i [2020-07-10 15:25:54,696 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:54,704 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:54,719 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:54,747 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:54,748 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:54,748 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:54,748 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:54,749 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:54,749 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:54,749 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:54,749 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-10 15:25:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:25:54,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:54,779 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:54,779 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1377249276, now seen corresponding path program 1 times [2020-07-10 15:25:54,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:54,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104083081] [2020-07-10 15:25:54,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {42#true} is VALID [2020-07-10 15:25:55,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 15:25:55,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #85#return; {42#true} is VALID [2020-07-10 15:25:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {42#true} is VALID [2020-07-10 15:25:55,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-10 15:25:55,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-10 15:25:55,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #89#return; {43#false} is VALID [2020-07-10 15:25:55,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104083081] [2020-07-10 15:25:55,106 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-10 15:25:55,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24366101] [2020-07-10 15:25:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,261 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-10 15:25:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:55,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2020-07-10 15:25:55,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {42#true} is VALID [2020-07-10 15:25:55,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 15:25:55,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #85#return; {42#true} is VALID [2020-07-10 15:25:55,397 INFO L263 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2020-07-10 15:25:55,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2020-07-10 15:25:55,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {42#true} is VALID [2020-07-10 15:25:55,399 INFO L263 TraceCheckUtils]: 7: Hoare triple {42#true} call init_nondet(~#x~0.base, ~#x~0.offset); {42#true} is VALID [2020-07-10 15:25:55,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {42#true} is VALID [2020-07-10 15:25:55,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-10 15:25:55,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-10 15:25:55,401 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {43#false} {42#true} #89#return; {43#false} is VALID [2020-07-10 15:25:55,401 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {43#false} is VALID [2020-07-10 15:25:55,402 INFO L263 TraceCheckUtils]: 13: Hoare triple {43#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-10 15:25:55,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {43#false} is VALID [2020-07-10 15:25:55,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-10 15:25:55,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {43#false} is VALID [2020-07-10 15:25:55,403 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-10 15:25:55,404 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {43#false} {43#false} #91#return; {43#false} is VALID [2020-07-10 15:25:55,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {43#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {43#false} is VALID [2020-07-10 15:25:55,405 INFO L263 TraceCheckUtils]: 20: Hoare triple {43#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-10 15:25:55,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {43#false} is VALID [2020-07-10 15:25:55,405 INFO L280 TraceCheckUtils]: 22: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-10 15:25:55,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {43#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {43#false} is VALID [2020-07-10 15:25:55,406 INFO L280 TraceCheckUtils]: 24: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-10 15:25:55,407 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {43#false} {43#false} #93#return; {43#false} is VALID [2020-07-10 15:25:55,407 INFO L280 TraceCheckUtils]: 26: Hoare triple {43#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {43#false} is VALID [2020-07-10 15:25:55,408 INFO L280 TraceCheckUtils]: 27: Hoare triple {43#false} assume !(~i~2 < ~N~0 - 1); {43#false} is VALID [2020-07-10 15:25:55,408 INFO L280 TraceCheckUtils]: 28: Hoare triple {43#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {43#false} is VALID [2020-07-10 15:25:55,409 INFO L263 TraceCheckUtils]: 29: Hoare triple {43#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-10 15:25:55,409 INFO L280 TraceCheckUtils]: 30: Hoare triple {43#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {43#false} is VALID [2020-07-10 15:25:55,409 INFO L280 TraceCheckUtils]: 31: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-10 15:25:55,410 INFO L280 TraceCheckUtils]: 32: Hoare triple {43#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {43#false} is VALID [2020-07-10 15:25:55,410 INFO L280 TraceCheckUtils]: 33: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-10 15:25:55,410 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {43#false} {43#false} #95#return; {43#false} is VALID [2020-07-10 15:25:55,411 INFO L280 TraceCheckUtils]: 35: Hoare triple {43#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {43#false} is VALID [2020-07-10 15:25:55,411 INFO L280 TraceCheckUtils]: 36: Hoare triple {43#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {43#false} is VALID [2020-07-10 15:25:55,412 INFO L280 TraceCheckUtils]: 37: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-10 15:25:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:25:55,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:55,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:25:55,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776409477] [2020-07-10 15:25:55,430 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2020-07-10 15:25:55,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:55,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:25:55,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:25:55,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:55,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:25:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:25:55,518 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2020-07-10 15:25:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,666 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2020-07-10 15:25:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:25:55,667 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2020-07-10 15:25:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:25:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2020-07-10 15:25:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:25:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2020-07-10 15:25:55,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2020-07-10 15:25:55,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,874 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:25:55,874 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 15:25:55,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:25:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 15:25:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 15:25:55,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:55,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 15:25:55,952 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 15:25:55,952 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 15:25:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,963 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-10 15:25:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-10 15:25:55,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,965 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 15:25:55,965 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 15:25:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,971 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-10 15:25:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-10 15:25:55,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:55,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:25:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-07-10 15:25:55,979 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2020-07-10 15:25:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:55,979 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-10 15:25:55,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:25:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-10 15:25:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:25:55,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:55,982 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:56,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-10 15:25:56,199 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1240892162, now seen corresponding path program 1 times [2020-07-10 15:25:56,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344053583] [2020-07-10 15:25:56,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,222 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:25:56,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928192747] [2020-07-10 15:25:56,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:25:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:56,370 INFO L263 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2020-07-10 15:25:56,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {379#true} is VALID [2020-07-10 15:25:56,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-10 15:25:56,371 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #85#return; {379#true} is VALID [2020-07-10 15:25:56,371 INFO L263 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret13 := main(); {379#true} is VALID [2020-07-10 15:25:56,372 INFO L280 TraceCheckUtils]: 5: Hoare triple {379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {379#true} is VALID [2020-07-10 15:25:56,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {379#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {379#true} is VALID [2020-07-10 15:25:56,372 INFO L263 TraceCheckUtils]: 7: Hoare triple {379#true} call init_nondet(~#x~0.base, ~#x~0.offset); {379#true} is VALID [2020-07-10 15:25:56,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {379#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {379#true} is VALID [2020-07-10 15:25:56,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {379#true} assume !(~i~0 < ~N~0); {379#true} is VALID [2020-07-10 15:25:56,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-10 15:25:56,373 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {379#true} {379#true} #89#return; {379#true} is VALID [2020-07-10 15:25:56,374 INFO L280 TraceCheckUtils]: 12: Hoare triple {379#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {379#true} is VALID [2020-07-10 15:25:56,374 INFO L263 TraceCheckUtils]: 13: Hoare triple {379#true} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {379#true} is VALID [2020-07-10 15:25:56,375 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {426#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:56,376 INFO L280 TraceCheckUtils]: 15: Hoare triple {426#(= 0 rangesum_~cnt~0)} assume !(~i~1 < ~N~0); {426#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:56,377 INFO L280 TraceCheckUtils]: 16: Hoare triple {426#(= 0 rangesum_~cnt~0)} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {380#false} is VALID [2020-07-10 15:25:56,378 INFO L280 TraceCheckUtils]: 17: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-10 15:25:56,378 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {380#false} {379#true} #91#return; {380#false} is VALID [2020-07-10 15:25:56,379 INFO L280 TraceCheckUtils]: 19: Hoare triple {380#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {380#false} is VALID [2020-07-10 15:25:56,379 INFO L263 TraceCheckUtils]: 20: Hoare triple {380#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {380#false} is VALID [2020-07-10 15:25:56,379 INFO L280 TraceCheckUtils]: 21: Hoare triple {380#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {380#false} is VALID [2020-07-10 15:25:56,380 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#false} assume !(~i~1 < ~N~0); {380#false} is VALID [2020-07-10 15:25:56,380 INFO L280 TraceCheckUtils]: 23: Hoare triple {380#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {380#false} is VALID [2020-07-10 15:25:56,380 INFO L280 TraceCheckUtils]: 24: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-10 15:25:56,381 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {380#false} {380#false} #93#return; {380#false} is VALID [2020-07-10 15:25:56,381 INFO L280 TraceCheckUtils]: 26: Hoare triple {380#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {380#false} is VALID [2020-07-10 15:25:56,381 INFO L280 TraceCheckUtils]: 27: Hoare triple {380#false} assume !(~i~2 < ~N~0 - 1); {380#false} is VALID [2020-07-10 15:25:56,381 INFO L280 TraceCheckUtils]: 28: Hoare triple {380#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {380#false} is VALID [2020-07-10 15:25:56,382 INFO L263 TraceCheckUtils]: 29: Hoare triple {380#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {380#false} is VALID [2020-07-10 15:25:56,382 INFO L280 TraceCheckUtils]: 30: Hoare triple {380#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {380#false} is VALID [2020-07-10 15:25:56,382 INFO L280 TraceCheckUtils]: 31: Hoare triple {380#false} assume !(~i~1 < ~N~0); {380#false} is VALID [2020-07-10 15:25:56,383 INFO L280 TraceCheckUtils]: 32: Hoare triple {380#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {380#false} is VALID [2020-07-10 15:25:56,383 INFO L280 TraceCheckUtils]: 33: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-10 15:25:56,384 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {380#false} {380#false} #95#return; {380#false} is VALID [2020-07-10 15:25:56,384 INFO L280 TraceCheckUtils]: 35: Hoare triple {380#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {380#false} is VALID [2020-07-10 15:25:56,384 INFO L280 TraceCheckUtils]: 36: Hoare triple {380#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {380#false} is VALID [2020-07-10 15:25:56,384 INFO L280 TraceCheckUtils]: 37: Hoare triple {380#false} assume !false; {380#false} is VALID [2020-07-10 15:25:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-10 15:25:56,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344053583] [2020-07-10 15:25:56,387 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:25:56,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928192747] [2020-07-10 15:25:56,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:56,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:56,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950779899] [2020-07-10 15:25:56,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-10 15:25:56,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:56,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:56,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:56,445 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2020-07-10 15:25:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,582 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2020-07-10 15:25:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:56,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-10 15:25:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2020-07-10 15:25:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2020-07-10 15:25:56,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2020-07-10 15:25:56,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,741 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:25:56,741 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:25:56,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:25:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-10 15:25:56,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-10 15:25:56,768 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-10 15:25:56,768 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-10 15:25:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,773 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-10 15:25:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-10 15:25:56,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,775 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-10 15:25:56,775 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-10 15:25:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,780 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-10 15:25:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-10 15:25:56,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 15:25:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-07-10 15:25:56,786 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2020-07-10 15:25:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,786 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-07-10 15:25:56,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-10 15:25:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:25:56,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,789 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:57,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:57,004 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1742767491, now seen corresponding path program 1 times [2020-07-10 15:25:57,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910151267] [2020-07-10 15:25:57,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {700#true} is VALID [2020-07-10 15:25:57,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {700#true} {700#true} #85#return; {700#true} is VALID [2020-07-10 15:25:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {727#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:57,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {727#(<= init_nondet_~i~0 0)} assume !(~i~0 < ~N~0); {728#(<= ~N~0 0)} is VALID [2020-07-10 15:25:57,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {728#(<= ~N~0 0)} assume true; {728#(<= ~N~0 0)} is VALID [2020-07-10 15:25:57,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {728#(<= ~N~0 0)} {705#(<= 2 ~N~0)} #89#return; {701#false} is VALID [2020-07-10 15:25:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {700#true} is VALID [2020-07-10 15:25:57,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-10 15:25:57,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-10 15:25:57,216 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,216 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #91#return; {701#false} is VALID [2020-07-10 15:25:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {700#true} is VALID [2020-07-10 15:25:57,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-10 15:25:57,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-10 15:25:57,241 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,242 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #93#return; {701#false} is VALID [2020-07-10 15:25:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {700#true} is VALID [2020-07-10 15:25:57,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-10 15:25:57,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-10 15:25:57,259 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,259 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #95#return; {701#false} is VALID [2020-07-10 15:25:57,265 INFO L263 TraceCheckUtils]: 0: Hoare triple {700#true} call ULTIMATE.init(); {725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:57,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {700#true} is VALID [2020-07-10 15:25:57,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,266 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {700#true} {700#true} #85#return; {700#true} is VALID [2020-07-10 15:25:57,266 INFO L263 TraceCheckUtils]: 4: Hoare triple {700#true} call #t~ret13 := main(); {700#true} is VALID [2020-07-10 15:25:57,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {700#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {700#true} is VALID [2020-07-10 15:25:57,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {705#(<= 2 ~N~0)} is VALID [2020-07-10 15:25:57,270 INFO L263 TraceCheckUtils]: 7: Hoare triple {705#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {726#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:25:57,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {726#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {727#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:57,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {727#(<= init_nondet_~i~0 0)} assume !(~i~0 < ~N~0); {728#(<= ~N~0 0)} is VALID [2020-07-10 15:25:57,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {728#(<= ~N~0 0)} assume true; {728#(<= ~N~0 0)} is VALID [2020-07-10 15:25:57,274 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {728#(<= ~N~0 0)} {705#(<= 2 ~N~0)} #89#return; {701#false} is VALID [2020-07-10 15:25:57,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {701#false} is VALID [2020-07-10 15:25:57,275 INFO L263 TraceCheckUtils]: 13: Hoare triple {701#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-10 15:25:57,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {700#true} is VALID [2020-07-10 15:25:57,275 INFO L280 TraceCheckUtils]: 15: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-10 15:25:57,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-10 15:25:57,276 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,276 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {700#true} {701#false} #91#return; {701#false} is VALID [2020-07-10 15:25:57,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {701#false} is VALID [2020-07-10 15:25:57,282 INFO L263 TraceCheckUtils]: 20: Hoare triple {701#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-10 15:25:57,282 INFO L280 TraceCheckUtils]: 21: Hoare triple {700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {700#true} is VALID [2020-07-10 15:25:57,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-10 15:25:57,283 INFO L280 TraceCheckUtils]: 23: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-10 15:25:57,283 INFO L280 TraceCheckUtils]: 24: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,284 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {700#true} {701#false} #93#return; {701#false} is VALID [2020-07-10 15:25:57,284 INFO L280 TraceCheckUtils]: 26: Hoare triple {701#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {701#false} is VALID [2020-07-10 15:25:57,284 INFO L280 TraceCheckUtils]: 27: Hoare triple {701#false} assume !(~i~2 < ~N~0 - 1); {701#false} is VALID [2020-07-10 15:25:57,284 INFO L280 TraceCheckUtils]: 28: Hoare triple {701#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {701#false} is VALID [2020-07-10 15:25:57,285 INFO L263 TraceCheckUtils]: 29: Hoare triple {701#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-10 15:25:57,285 INFO L280 TraceCheckUtils]: 30: Hoare triple {700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {700#true} is VALID [2020-07-10 15:25:57,285 INFO L280 TraceCheckUtils]: 31: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-10 15:25:57,286 INFO L280 TraceCheckUtils]: 32: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-10 15:25:57,286 INFO L280 TraceCheckUtils]: 33: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-10 15:25:57,292 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {700#true} {701#false} #95#return; {701#false} is VALID [2020-07-10 15:25:57,293 INFO L280 TraceCheckUtils]: 35: Hoare triple {701#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {701#false} is VALID [2020-07-10 15:25:57,293 INFO L280 TraceCheckUtils]: 36: Hoare triple {701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {701#false} is VALID [2020-07-10 15:25:57,293 INFO L280 TraceCheckUtils]: 37: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-10 15:25:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:25:57,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910151267] [2020-07-10 15:25:57,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:57,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:25:57,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978011487] [2020-07-10 15:25:57,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-10 15:25:57,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:25:57,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:25:57,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:25:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:25:57,346 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 7 states. [2020-07-10 15:25:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,155 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-07-10 15:25:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:25:58,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-10 15:25:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:25:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-10 15:25:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:25:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-10 15:25:58,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2020-07-10 15:25:58,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,300 INFO L225 Difference]: With dead ends: 65 [2020-07-10 15:25:58,301 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:25:58,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:25:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:25:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-10 15:25:58,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:58,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-10 15:25:58,349 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-10 15:25:58,349 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-10 15:25:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,353 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-10 15:25:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-10 15:25:58,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,354 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-10 15:25:58,355 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-10 15:25:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,358 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-10 15:25:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-10 15:25:58,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:58,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 15:25:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-10 15:25:58,364 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 38 [2020-07-10 15:25:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:58,364 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-10 15:25:58,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:25:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-10 15:25:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:25:58,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:58,370 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:58,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:25:58,370 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash 558201179, now seen corresponding path program 1 times [2020-07-10 15:25:58,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990001306] [2020-07-10 15:25:58,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {993#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {966#true} is VALID [2020-07-10 15:25:58,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,447 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-10 15:25:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {994#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {995#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:58,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#(<= init_nondet_~i~0 0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {995#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:58,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {995#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {996#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:25:58,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {996#(<= init_nondet_~i~0 1)} assume !(~i~0 < ~N~0); {997#(<= ~N~0 1)} is VALID [2020-07-10 15:25:58,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#(<= ~N~0 1)} assume true; {997#(<= ~N~0 1)} is VALID [2020-07-10 15:25:58,505 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {997#(<= ~N~0 1)} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-10 15:25:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {966#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {966#true} is VALID [2020-07-10 15:25:58,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-10 15:25:58,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-10 15:25:58,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,513 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #91#return; {967#false} is VALID [2020-07-10 15:25:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {966#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {966#true} is VALID [2020-07-10 15:25:58,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-10 15:25:58,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-10 15:25:58,521 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,521 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #93#return; {967#false} is VALID [2020-07-10 15:25:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {966#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {966#true} is VALID [2020-07-10 15:25:58,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-10 15:25:58,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-10 15:25:58,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,529 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #95#return; {967#false} is VALID [2020-07-10 15:25:58,531 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {993#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:58,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {993#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {966#true} is VALID [2020-07-10 15:25:58,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-10 15:25:58,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret13 := main(); {966#true} is VALID [2020-07-10 15:25:58,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {966#true} is VALID [2020-07-10 15:25:58,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {966#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {971#(<= 2 ~N~0)} is VALID [2020-07-10 15:25:58,535 INFO L263 TraceCheckUtils]: 7: Hoare triple {971#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {994#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:25:58,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {994#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {995#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:58,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {995#(<= init_nondet_~i~0 0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {995#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:58,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {996#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:25:58,539 INFO L280 TraceCheckUtils]: 11: Hoare triple {996#(<= init_nondet_~i~0 1)} assume !(~i~0 < ~N~0); {997#(<= ~N~0 1)} is VALID [2020-07-10 15:25:58,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {997#(<= ~N~0 1)} assume true; {997#(<= ~N~0 1)} is VALID [2020-07-10 15:25:58,541 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {997#(<= ~N~0 1)} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-10 15:25:58,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {967#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {967#false} is VALID [2020-07-10 15:25:58,542 INFO L263 TraceCheckUtils]: 15: Hoare triple {967#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-10 15:25:58,542 INFO L280 TraceCheckUtils]: 16: Hoare triple {966#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {966#true} is VALID [2020-07-10 15:25:58,542 INFO L280 TraceCheckUtils]: 17: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-10 15:25:58,542 INFO L280 TraceCheckUtils]: 18: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-10 15:25:58,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,543 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {966#true} {967#false} #91#return; {967#false} is VALID [2020-07-10 15:25:58,543 INFO L280 TraceCheckUtils]: 21: Hoare triple {967#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {967#false} is VALID [2020-07-10 15:25:58,543 INFO L263 TraceCheckUtils]: 22: Hoare triple {967#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-10 15:25:58,544 INFO L280 TraceCheckUtils]: 23: Hoare triple {966#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {966#true} is VALID [2020-07-10 15:25:58,544 INFO L280 TraceCheckUtils]: 24: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-10 15:25:58,544 INFO L280 TraceCheckUtils]: 25: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-10 15:25:58,544 INFO L280 TraceCheckUtils]: 26: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,545 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {966#true} {967#false} #93#return; {967#false} is VALID [2020-07-10 15:25:58,545 INFO L280 TraceCheckUtils]: 28: Hoare triple {967#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {967#false} is VALID [2020-07-10 15:25:58,545 INFO L280 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(~i~2 < ~N~0 - 1); {967#false} is VALID [2020-07-10 15:25:58,545 INFO L280 TraceCheckUtils]: 30: Hoare triple {967#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {967#false} is VALID [2020-07-10 15:25:58,546 INFO L263 TraceCheckUtils]: 31: Hoare triple {967#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-10 15:25:58,546 INFO L280 TraceCheckUtils]: 32: Hoare triple {966#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {966#true} is VALID [2020-07-10 15:25:58,546 INFO L280 TraceCheckUtils]: 33: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-10 15:25:58,546 INFO L280 TraceCheckUtils]: 34: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-10 15:25:58,547 INFO L280 TraceCheckUtils]: 35: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,547 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {966#true} {967#false} #95#return; {967#false} is VALID [2020-07-10 15:25:58,547 INFO L280 TraceCheckUtils]: 37: Hoare triple {967#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {967#false} is VALID [2020-07-10 15:25:58,547 INFO L280 TraceCheckUtils]: 38: Hoare triple {967#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {967#false} is VALID [2020-07-10 15:25:58,547 INFO L280 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-10 15:25:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:25:58,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990001306] [2020-07-10 15:25:58,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356505686] [2020-07-10 15:25:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:25:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:58,732 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-10 15:25:58,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {966#true} is VALID [2020-07-10 15:25:58,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:25:58,733 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-10 15:25:58,733 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret13 := main(); {966#true} is VALID [2020-07-10 15:25:58,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {966#true} is VALID [2020-07-10 15:25:58,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {966#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {971#(<= 2 ~N~0)} is VALID [2020-07-10 15:25:58,736 INFO L263 TraceCheckUtils]: 7: Hoare triple {971#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {971#(<= 2 ~N~0)} is VALID [2020-07-10 15:25:58,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {971#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1025#(and (<= init_nondet_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:25:58,743 INFO L280 TraceCheckUtils]: 9: Hoare triple {1025#(and (<= init_nondet_~i~0 0) (<= 2 ~N~0))} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1025#(and (<= init_nondet_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:25:58,744 INFO L280 TraceCheckUtils]: 10: Hoare triple {1025#(and (<= init_nondet_~i~0 0) (<= 2 ~N~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1032#(and (<= init_nondet_~i~0 1) (<= 2 ~N~0))} is VALID [2020-07-10 15:25:58,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {1032#(and (<= init_nondet_~i~0 1) (<= 2 ~N~0))} assume !(~i~0 < ~N~0); {967#false} is VALID [2020-07-10 15:25:58,745 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-10 15:25:58,745 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {967#false} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-10 15:25:58,745 INFO L280 TraceCheckUtils]: 14: Hoare triple {967#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {967#false} is VALID [2020-07-10 15:25:58,745 INFO L263 TraceCheckUtils]: 15: Hoare triple {967#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-10 15:25:58,746 INFO L280 TraceCheckUtils]: 16: Hoare triple {967#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {967#false} is VALID [2020-07-10 15:25:58,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-10 15:25:58,746 INFO L280 TraceCheckUtils]: 18: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-10 15:25:58,746 INFO L280 TraceCheckUtils]: 19: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-10 15:25:58,747 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {967#false} {967#false} #91#return; {967#false} is VALID [2020-07-10 15:25:58,747 INFO L280 TraceCheckUtils]: 21: Hoare triple {967#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {967#false} is VALID [2020-07-10 15:25:58,747 INFO L263 TraceCheckUtils]: 22: Hoare triple {967#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-10 15:25:58,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {967#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {967#false} is VALID [2020-07-10 15:25:58,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-10 15:25:58,748 INFO L280 TraceCheckUtils]: 25: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-10 15:25:58,748 INFO L280 TraceCheckUtils]: 26: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-10 15:25:58,748 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {967#false} {967#false} #93#return; {967#false} is VALID [2020-07-10 15:25:58,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {967#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {967#false} is VALID [2020-07-10 15:25:58,748 INFO L280 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(~i~2 < ~N~0 - 1); {967#false} is VALID [2020-07-10 15:25:58,749 INFO L280 TraceCheckUtils]: 30: Hoare triple {967#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {967#false} is VALID [2020-07-10 15:25:58,749 INFO L263 TraceCheckUtils]: 31: Hoare triple {967#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-10 15:25:58,749 INFO L280 TraceCheckUtils]: 32: Hoare triple {967#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {967#false} is VALID [2020-07-10 15:25:58,749 INFO L280 TraceCheckUtils]: 33: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-10 15:25:58,750 INFO L280 TraceCheckUtils]: 34: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-10 15:25:58,750 INFO L280 TraceCheckUtils]: 35: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-10 15:25:58,750 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {967#false} {967#false} #95#return; {967#false} is VALID [2020-07-10 15:25:58,751 INFO L280 TraceCheckUtils]: 37: Hoare triple {967#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {967#false} is VALID [2020-07-10 15:25:58,751 INFO L280 TraceCheckUtils]: 38: Hoare triple {967#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {967#false} is VALID [2020-07-10 15:25:58,751 INFO L280 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-10 15:25:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:25:58,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:58,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2020-07-10 15:25:58,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659737652] [2020-07-10 15:25:58,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-10 15:25:58,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:25:58,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:25:58,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:25:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:25:58,821 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-07-10 15:26:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,016 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2020-07-10 15:26:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:26:00,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-10 15:26:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-07-10 15:26:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-07-10 15:26:00,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2020-07-10 15:26:00,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,149 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:26:00,150 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:26:00,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:26:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:26:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-07-10 15:26:00,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:00,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2020-07-10 15:26:00,208 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2020-07-10 15:26:00,208 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2020-07-10 15:26:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,217 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-10 15:26:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-10 15:26:00,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,218 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2020-07-10 15:26:00,218 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2020-07-10 15:26:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,224 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-10 15:26:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-10 15:26:00,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:00,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:26:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 15:26:00,236 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 40 [2020-07-10 15:26:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:00,236 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 15:26:00,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:26:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 15:26:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 15:26:00,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:00,243 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:00,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,445 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash -119064391, now seen corresponding path program 2 times [2020-07-10 15:26:00,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:00,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917852734] [2020-07-10 15:26:00,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {1395#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1366#true} is VALID [2020-07-10 15:26:00,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,553 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-10 15:26:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {1396#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1366#true} is VALID [2020-07-10 15:26:00,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1366#true} is VALID [2020-07-10 15:26:00,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2020-07-10 15:26:00,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1366#true} is VALID [2020-07-10 15:26:00,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1366#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2020-07-10 15:26:00,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} assume !(~i~0 < ~N~0); {1366#true} is VALID [2020-07-10 15:26:00,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,586 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1366#true} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {1366#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1397#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:00,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {1397#(<= rangesum_~i~1 0)} assume !(~i~1 < ~N~0); {1398#(<= ~N~0 0)} is VALID [2020-07-10 15:26:00,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {1398#(<= ~N~0 0)} assume !(0 != ~cnt~0);#res := 0; {1398#(<= ~N~0 0)} is VALID [2020-07-10 15:26:00,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {1398#(<= ~N~0 0)} assume true; {1398#(<= ~N~0 0)} is VALID [2020-07-10 15:26:00,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1398#(<= ~N~0 0)} {1371#(<= 2 ~N~0)} #91#return; {1367#false} is VALID [2020-07-10 15:26:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {1366#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1366#true} is VALID [2020-07-10 15:26:00,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-10 15:26:00,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-10 15:26:00,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,643 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1366#true} {1367#false} #93#return; {1367#false} is VALID [2020-07-10 15:26:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {1366#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1366#true} is VALID [2020-07-10 15:26:00,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-10 15:26:00,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-10 15:26:00,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,660 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1366#true} {1367#false} #95#return; {1367#false} is VALID [2020-07-10 15:26:00,662 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1395#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:00,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {1395#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1366#true} is VALID [2020-07-10 15:26:00,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-10 15:26:00,663 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2020-07-10 15:26:00,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {1366#true} is VALID [2020-07-10 15:26:00,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {1366#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,665 INFO L263 TraceCheckUtils]: 7: Hoare triple {1371#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {1396#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:00,666 INFO L280 TraceCheckUtils]: 8: Hoare triple {1396#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1366#true} is VALID [2020-07-10 15:26:00,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {1366#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1366#true} is VALID [2020-07-10 15:26:00,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {1366#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2020-07-10 15:26:00,666 INFO L280 TraceCheckUtils]: 11: Hoare triple {1366#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1366#true} is VALID [2020-07-10 15:26:00,666 INFO L280 TraceCheckUtils]: 12: Hoare triple {1366#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2020-07-10 15:26:00,667 INFO L280 TraceCheckUtils]: 13: Hoare triple {1366#true} assume !(~i~0 < ~N~0); {1366#true} is VALID [2020-07-10 15:26:00,667 INFO L280 TraceCheckUtils]: 14: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,668 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1366#true} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,668 INFO L280 TraceCheckUtils]: 16: Hoare triple {1371#(<= 2 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,669 INFO L263 TraceCheckUtils]: 17: Hoare triple {1371#(<= 2 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-10 15:26:00,669 INFO L280 TraceCheckUtils]: 18: Hoare triple {1366#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1397#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:00,670 INFO L280 TraceCheckUtils]: 19: Hoare triple {1397#(<= rangesum_~i~1 0)} assume !(~i~1 < ~N~0); {1398#(<= ~N~0 0)} is VALID [2020-07-10 15:26:00,670 INFO L280 TraceCheckUtils]: 20: Hoare triple {1398#(<= ~N~0 0)} assume !(0 != ~cnt~0);#res := 0; {1398#(<= ~N~0 0)} is VALID [2020-07-10 15:26:00,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {1398#(<= ~N~0 0)} assume true; {1398#(<= ~N~0 0)} is VALID [2020-07-10 15:26:00,672 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1398#(<= ~N~0 0)} {1371#(<= 2 ~N~0)} #91#return; {1367#false} is VALID [2020-07-10 15:26:00,672 INFO L280 TraceCheckUtils]: 23: Hoare triple {1367#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1367#false} is VALID [2020-07-10 15:26:00,672 INFO L263 TraceCheckUtils]: 24: Hoare triple {1367#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-10 15:26:00,672 INFO L280 TraceCheckUtils]: 25: Hoare triple {1366#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1366#true} is VALID [2020-07-10 15:26:00,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-10 15:26:00,673 INFO L280 TraceCheckUtils]: 27: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-10 15:26:00,673 INFO L280 TraceCheckUtils]: 28: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,673 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1366#true} {1367#false} #93#return; {1367#false} is VALID [2020-07-10 15:26:00,673 INFO L280 TraceCheckUtils]: 30: Hoare triple {1367#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1367#false} is VALID [2020-07-10 15:26:00,673 INFO L280 TraceCheckUtils]: 31: Hoare triple {1367#false} assume !(~i~2 < ~N~0 - 1); {1367#false} is VALID [2020-07-10 15:26:00,674 INFO L280 TraceCheckUtils]: 32: Hoare triple {1367#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {1367#false} is VALID [2020-07-10 15:26:00,674 INFO L263 TraceCheckUtils]: 33: Hoare triple {1367#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-10 15:26:00,674 INFO L280 TraceCheckUtils]: 34: Hoare triple {1366#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1366#true} is VALID [2020-07-10 15:26:00,674 INFO L280 TraceCheckUtils]: 35: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-10 15:26:00,674 INFO L280 TraceCheckUtils]: 36: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-10 15:26:00,675 INFO L280 TraceCheckUtils]: 37: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,675 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1366#true} {1367#false} #95#return; {1367#false} is VALID [2020-07-10 15:26:00,675 INFO L280 TraceCheckUtils]: 39: Hoare triple {1367#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1367#false} is VALID [2020-07-10 15:26:00,675 INFO L280 TraceCheckUtils]: 40: Hoare triple {1367#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1367#false} is VALID [2020-07-10 15:26:00,675 INFO L280 TraceCheckUtils]: 41: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-10 15:26:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-10 15:26:00,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917852734] [2020-07-10 15:26:00,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016709669] [2020-07-10 15:26:00,682 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:26:00,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:00,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:00,856 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2020-07-10 15:26:00,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1366#true} is VALID [2020-07-10 15:26:00,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:26:00,857 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-10 15:26:00,857 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2020-07-10 15:26:00,858 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {1366#true} is VALID [2020-07-10 15:26:00,859 INFO L280 TraceCheckUtils]: 6: Hoare triple {1366#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,861 INFO L263 TraceCheckUtils]: 7: Hoare triple {1371#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,862 INFO L280 TraceCheckUtils]: 8: Hoare triple {1371#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,863 INFO L280 TraceCheckUtils]: 9: Hoare triple {1371#(<= 2 ~N~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,864 INFO L280 TraceCheckUtils]: 10: Hoare triple {1371#(<= 2 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,865 INFO L280 TraceCheckUtils]: 11: Hoare triple {1371#(<= 2 ~N~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,866 INFO L280 TraceCheckUtils]: 12: Hoare triple {1371#(<= 2 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,867 INFO L280 TraceCheckUtils]: 13: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,876 INFO L280 TraceCheckUtils]: 14: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,877 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,878 INFO L280 TraceCheckUtils]: 16: Hoare triple {1371#(<= 2 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,879 INFO L263 TraceCheckUtils]: 17: Hoare triple {1371#(<= 2 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,880 INFO L280 TraceCheckUtils]: 18: Hoare triple {1371#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,881 INFO L280 TraceCheckUtils]: 19: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~1 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,882 INFO L280 TraceCheckUtils]: 20: Hoare triple {1371#(<= 2 ~N~0)} assume !(0 != ~cnt~0);#res := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,883 INFO L280 TraceCheckUtils]: 21: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,884 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #91#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {1371#(<= 2 ~N~0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,887 INFO L263 TraceCheckUtils]: 24: Hoare triple {1371#(<= 2 ~N~0)} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,896 INFO L280 TraceCheckUtils]: 25: Hoare triple {1371#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,898 INFO L280 TraceCheckUtils]: 26: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~1 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,898 INFO L280 TraceCheckUtils]: 27: Hoare triple {1371#(<= 2 ~N~0)} assume !(0 != ~cnt~0);#res := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,899 INFO L280 TraceCheckUtils]: 28: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,900 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #93#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,901 INFO L280 TraceCheckUtils]: 30: Hoare triple {1371#(<= 2 ~N~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,902 INFO L280 TraceCheckUtils]: 31: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~2 < ~N~0 - 1); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,903 INFO L280 TraceCheckUtils]: 32: Hoare triple {1371#(<= 2 ~N~0)} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,906 INFO L263 TraceCheckUtils]: 33: Hoare triple {1371#(<= 2 ~N~0)} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1371#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:00,907 INFO L280 TraceCheckUtils]: 34: Hoare triple {1371#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1504#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:26:00,909 INFO L280 TraceCheckUtils]: 35: Hoare triple {1504#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} assume !(~i~1 < ~N~0); {1367#false} is VALID [2020-07-10 15:26:00,909 INFO L280 TraceCheckUtils]: 36: Hoare triple {1367#false} assume !(0 != ~cnt~0);#res := 0; {1367#false} is VALID [2020-07-10 15:26:00,909 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} assume true; {1367#false} is VALID [2020-07-10 15:26:00,909 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1367#false} {1371#(<= 2 ~N~0)} #95#return; {1367#false} is VALID [2020-07-10 15:26:00,910 INFO L280 TraceCheckUtils]: 39: Hoare triple {1367#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1367#false} is VALID [2020-07-10 15:26:00,910 INFO L280 TraceCheckUtils]: 40: Hoare triple {1367#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1367#false} is VALID [2020-07-10 15:26:00,910 INFO L280 TraceCheckUtils]: 41: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-10 15:26:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-10 15:26:00,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:00,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2020-07-10 15:26:00,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123455236] [2020-07-10 15:26:00,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-10 15:26:00,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:00,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:00,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:00,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:26:00,963 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2020-07-10 15:26:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,155 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-10 15:26:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:01,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-10 15:26:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-10 15:26:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-10 15:26:01,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2020-07-10 15:26:01,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:01,256 INFO L225 Difference]: With dead ends: 65 [2020-07-10 15:26:01,257 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 15:26:01,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:26:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 15:26:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-10 15:26:01,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:01,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-10 15:26:01,298 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-10 15:26:01,298 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-10 15:26:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,301 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-10 15:26:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-10 15:26:01,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:01,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:01,303 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-10 15:26:01,303 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-10 15:26:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,305 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-10 15:26:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-10 15:26:01,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:01,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:01,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:01,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:26:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2020-07-10 15:26:01,309 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 42 [2020-07-10 15:26:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:01,310 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2020-07-10 15:26:01,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2020-07-10 15:26:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:26:01,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:01,311 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:01,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,527 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash -12268618, now seen corresponding path program 1 times [2020-07-10 15:26:01,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:01,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394317986] [2020-07-10 15:26:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {1796#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1758#true} is VALID [2020-07-10 15:26:01,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,610 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-10 15:26:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {1797#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1758#true} is VALID [2020-07-10 15:26:01,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1758#true} is VALID [2020-07-10 15:26:01,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1758#true} is VALID [2020-07-10 15:26:01,651 INFO L280 TraceCheckUtils]: 3: Hoare triple {1758#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1758#true} is VALID [2020-07-10 15:26:01,651 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1758#true} is VALID [2020-07-10 15:26:01,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(~i~0 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,653 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {1758#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1798#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:01,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {1798#(<= rangesum_~i~1 0)} assume !!(~i~1 < ~N~0); {1798#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:01,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {1798#(<= rangesum_~i~1 0)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1798#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:01,719 INFO L280 TraceCheckUtils]: 3: Hoare triple {1798#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1799#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:01,724 INFO L280 TraceCheckUtils]: 4: Hoare triple {1799#(<= rangesum_~i~1 1)} assume !(~i~1 < ~N~0); {1800#(<= ~N~0 1)} is VALID [2020-07-10 15:26:01,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {1800#(<= ~N~0 1)} assume !(0 != ~cnt~0);#res := 0; {1800#(<= ~N~0 1)} is VALID [2020-07-10 15:26:01,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {1800#(<= ~N~0 1)} assume true; {1800#(<= ~N~0 1)} is VALID [2020-07-10 15:26:01,726 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1800#(<= ~N~0 1)} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-10 15:26:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {1758#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1758#true} is VALID [2020-07-10 15:26:01,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1758#true} is VALID [2020-07-10 15:26:01,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {1758#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1758#true} is VALID [2020-07-10 15:26:01,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-10 15:26:01,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,748 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1759#false} #93#return; {1759#false} is VALID [2020-07-10 15:26:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {1758#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1758#true} is VALID [2020-07-10 15:26:01,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,771 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1758#true} is VALID [2020-07-10 15:26:01,771 INFO L280 TraceCheckUtils]: 3: Hoare triple {1758#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1758#true} is VALID [2020-07-10 15:26:01,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-10 15:26:01,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,772 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1759#false} #95#return; {1759#false} is VALID [2020-07-10 15:26:01,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1796#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:01,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {1796#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1758#true} is VALID [2020-07-10 15:26:01,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-10 15:26:01,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret13 := main(); {1758#true} is VALID [2020-07-10 15:26:01,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {1758#true} is VALID [2020-07-10 15:26:01,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,777 INFO L263 TraceCheckUtils]: 7: Hoare triple {1763#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {1797#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:01,777 INFO L280 TraceCheckUtils]: 8: Hoare triple {1797#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1758#true} is VALID [2020-07-10 15:26:01,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {1758#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1758#true} is VALID [2020-07-10 15:26:01,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {1758#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1758#true} is VALID [2020-07-10 15:26:01,778 INFO L280 TraceCheckUtils]: 11: Hoare triple {1758#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1758#true} is VALID [2020-07-10 15:26:01,778 INFO L280 TraceCheckUtils]: 12: Hoare triple {1758#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1758#true} is VALID [2020-07-10 15:26:01,778 INFO L280 TraceCheckUtils]: 13: Hoare triple {1758#true} assume !(~i~0 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,779 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1758#true} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {1763#(<= 2 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,780 INFO L263 TraceCheckUtils]: 17: Hoare triple {1763#(<= 2 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-10 15:26:01,781 INFO L280 TraceCheckUtils]: 18: Hoare triple {1758#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1798#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:01,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {1798#(<= rangesum_~i~1 0)} assume !!(~i~1 < ~N~0); {1798#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:01,783 INFO L280 TraceCheckUtils]: 20: Hoare triple {1798#(<= rangesum_~i~1 0)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1798#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:01,785 INFO L280 TraceCheckUtils]: 21: Hoare triple {1798#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1799#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:01,786 INFO L280 TraceCheckUtils]: 22: Hoare triple {1799#(<= rangesum_~i~1 1)} assume !(~i~1 < ~N~0); {1800#(<= ~N~0 1)} is VALID [2020-07-10 15:26:01,786 INFO L280 TraceCheckUtils]: 23: Hoare triple {1800#(<= ~N~0 1)} assume !(0 != ~cnt~0);#res := 0; {1800#(<= ~N~0 1)} is VALID [2020-07-10 15:26:01,787 INFO L280 TraceCheckUtils]: 24: Hoare triple {1800#(<= ~N~0 1)} assume true; {1800#(<= ~N~0 1)} is VALID [2020-07-10 15:26:01,788 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1800#(<= ~N~0 1)} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-10 15:26:01,788 INFO L280 TraceCheckUtils]: 26: Hoare triple {1759#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1759#false} is VALID [2020-07-10 15:26:01,788 INFO L263 TraceCheckUtils]: 27: Hoare triple {1759#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-10 15:26:01,789 INFO L280 TraceCheckUtils]: 28: Hoare triple {1758#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1758#true} is VALID [2020-07-10 15:26:01,789 INFO L280 TraceCheckUtils]: 29: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,789 INFO L280 TraceCheckUtils]: 30: Hoare triple {1758#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1758#true} is VALID [2020-07-10 15:26:01,789 INFO L280 TraceCheckUtils]: 31: Hoare triple {1758#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1758#true} is VALID [2020-07-10 15:26:01,790 INFO L280 TraceCheckUtils]: 32: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,790 INFO L280 TraceCheckUtils]: 33: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-10 15:26:01,790 INFO L280 TraceCheckUtils]: 34: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,791 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1758#true} {1759#false} #93#return; {1759#false} is VALID [2020-07-10 15:26:01,791 INFO L280 TraceCheckUtils]: 36: Hoare triple {1759#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1759#false} is VALID [2020-07-10 15:26:01,791 INFO L280 TraceCheckUtils]: 37: Hoare triple {1759#false} assume !(~i~2 < ~N~0 - 1); {1759#false} is VALID [2020-07-10 15:26:01,791 INFO L280 TraceCheckUtils]: 38: Hoare triple {1759#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {1759#false} is VALID [2020-07-10 15:26:01,791 INFO L263 TraceCheckUtils]: 39: Hoare triple {1759#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-10 15:26:01,792 INFO L280 TraceCheckUtils]: 40: Hoare triple {1758#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1758#true} is VALID [2020-07-10 15:26:01,792 INFO L280 TraceCheckUtils]: 41: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,792 INFO L280 TraceCheckUtils]: 42: Hoare triple {1758#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1758#true} is VALID [2020-07-10 15:26:01,792 INFO L280 TraceCheckUtils]: 43: Hoare triple {1758#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1758#true} is VALID [2020-07-10 15:26:01,792 INFO L280 TraceCheckUtils]: 44: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-10 15:26:01,798 INFO L280 TraceCheckUtils]: 45: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-10 15:26:01,799 INFO L280 TraceCheckUtils]: 46: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,799 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1758#true} {1759#false} #95#return; {1759#false} is VALID [2020-07-10 15:26:01,799 INFO L280 TraceCheckUtils]: 48: Hoare triple {1759#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1759#false} is VALID [2020-07-10 15:26:01,799 INFO L280 TraceCheckUtils]: 49: Hoare triple {1759#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1759#false} is VALID [2020-07-10 15:26:01,800 INFO L280 TraceCheckUtils]: 50: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2020-07-10 15:26:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-10 15:26:01,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394317986] [2020-07-10 15:26:01,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983990279] [2020-07-10 15:26:01,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:01,994 INFO L263 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1758#true} is VALID [2020-07-10 15:26:01,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1758#true} is VALID [2020-07-10 15:26:01,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-10 15:26:01,995 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-10 15:26:01,995 INFO L263 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret13 := main(); {1758#true} is VALID [2020-07-10 15:26:01,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {1758#true} is VALID [2020-07-10 15:26:01,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,997 INFO L263 TraceCheckUtils]: 7: Hoare triple {1763#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {1763#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {1763#(<= 2 ~N~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,998 INFO L280 TraceCheckUtils]: 10: Hoare triple {1763#(<= 2 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:01,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {1763#(<= 2 ~N~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {1763#(<= 2 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,000 INFO L280 TraceCheckUtils]: 13: Hoare triple {1763#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,001 INFO L280 TraceCheckUtils]: 14: Hoare triple {1763#(<= 2 ~N~0)} assume true; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,002 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1763#(<= 2 ~N~0)} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,002 INFO L280 TraceCheckUtils]: 16: Hoare triple {1763#(<= 2 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,003 INFO L263 TraceCheckUtils]: 17: Hoare triple {1763#(<= 2 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {1763#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:02,004 INFO L280 TraceCheckUtils]: 18: Hoare triple {1763#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1858#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:26:02,010 INFO L280 TraceCheckUtils]: 19: Hoare triple {1858#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} assume !!(~i~1 < ~N~0); {1858#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:26:02,011 INFO L280 TraceCheckUtils]: 20: Hoare triple {1858#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1858#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:26:02,013 INFO L280 TraceCheckUtils]: 21: Hoare triple {1858#(and (<= rangesum_~i~1 0) (<= 2 ~N~0))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1868#(and (<= 2 ~N~0) (<= rangesum_~i~1 1))} is VALID [2020-07-10 15:26:02,014 INFO L280 TraceCheckUtils]: 22: Hoare triple {1868#(and (<= 2 ~N~0) (<= rangesum_~i~1 1))} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-10 15:26:02,014 INFO L280 TraceCheckUtils]: 23: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-10 15:26:02,014 INFO L280 TraceCheckUtils]: 24: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-10 15:26:02,014 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1759#false} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-10 15:26:02,015 INFO L280 TraceCheckUtils]: 26: Hoare triple {1759#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1759#false} is VALID [2020-07-10 15:26:02,015 INFO L263 TraceCheckUtils]: 27: Hoare triple {1759#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1759#false} is VALID [2020-07-10 15:26:02,015 INFO L280 TraceCheckUtils]: 28: Hoare triple {1759#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1759#false} is VALID [2020-07-10 15:26:02,015 INFO L280 TraceCheckUtils]: 29: Hoare triple {1759#false} assume !!(~i~1 < ~N~0); {1759#false} is VALID [2020-07-10 15:26:02,015 INFO L280 TraceCheckUtils]: 30: Hoare triple {1759#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L280 TraceCheckUtils]: 31: Hoare triple {1759#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L280 TraceCheckUtils]: 32: Hoare triple {1759#false} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L280 TraceCheckUtils]: 33: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L280 TraceCheckUtils]: 34: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1759#false} {1759#false} #93#return; {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L280 TraceCheckUtils]: 36: Hoare triple {1759#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1759#false} is VALID [2020-07-10 15:26:02,016 INFO L280 TraceCheckUtils]: 37: Hoare triple {1759#false} assume !(~i~2 < ~N~0 - 1); {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L280 TraceCheckUtils]: 38: Hoare triple {1759#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L263 TraceCheckUtils]: 39: Hoare triple {1759#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L280 TraceCheckUtils]: 40: Hoare triple {1759#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L280 TraceCheckUtils]: 41: Hoare triple {1759#false} assume !!(~i~1 < ~N~0); {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L280 TraceCheckUtils]: 42: Hoare triple {1759#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L280 TraceCheckUtils]: 43: Hoare triple {1759#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1759#false} is VALID [2020-07-10 15:26:02,017 INFO L280 TraceCheckUtils]: 44: Hoare triple {1759#false} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-10 15:26:02,018 INFO L280 TraceCheckUtils]: 45: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-10 15:26:02,018 INFO L280 TraceCheckUtils]: 46: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-10 15:26:02,018 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1759#false} {1759#false} #95#return; {1759#false} is VALID [2020-07-10 15:26:02,018 INFO L280 TraceCheckUtils]: 48: Hoare triple {1759#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1759#false} is VALID [2020-07-10 15:26:02,018 INFO L280 TraceCheckUtils]: 49: Hoare triple {1759#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1759#false} is VALID [2020-07-10 15:26:02,018 INFO L280 TraceCheckUtils]: 50: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2020-07-10 15:26:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-10 15:26:02,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:02,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2020-07-10 15:26:02,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624070206] [2020-07-10 15:26:02,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-10 15:26:02,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:02,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:26:02,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:02,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:26:02,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:02,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:26:02,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:26:02,109 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2020-07-10 15:26:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,195 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-10 15:26:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:26:03,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-10 15:26:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2020-07-10 15:26:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2020-07-10 15:26:03,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2020-07-10 15:26:03,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,331 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:26:03,332 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 15:26:03,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:26:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 15:26:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-10 15:26:03,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-10 15:26:03,389 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-10 15:26:03,389 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-10 15:26:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,391 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-10 15:26:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-10 15:26:03,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,393 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-10 15:26:03,393 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-10 15:26:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,395 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-10 15:26:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-10 15:26:03,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:26:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-10 15:26:03,399 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 51 [2020-07-10 15:26:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,399 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-10 15:26:03,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:26:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-10 15:26:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 15:26:03,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,401 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:03,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:26:03,612 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 456134489, now seen corresponding path program 2 times [2020-07-10 15:26:03,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:03,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613776262] [2020-07-10 15:26:03,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {2270#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2222#true} is VALID [2020-07-10 15:26:03,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,710 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2222#true} {2222#true} #85#return; {2222#true} is VALID [2020-07-10 15:26:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {2271#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2222#true} is VALID [2020-07-10 15:26:03,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2222#true} is VALID [2020-07-10 15:26:03,727 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#true} is VALID [2020-07-10 15:26:03,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {2222#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2222#true} is VALID [2020-07-10 15:26:03,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#true} is VALID [2020-07-10 15:26:03,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume !(~i~0 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,728 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,729 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #89#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {2222#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2222#true} is VALID [2020-07-10 15:26:03,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,741 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,741 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-10 15:26:03,742 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,743 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #91#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {2222#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2222#true} is VALID [2020-07-10 15:26:03,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,754 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,755 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,756 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-10 15:26:03,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,757 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #93#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {2222#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2222#true} is VALID [2020-07-10 15:26:03,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,766 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,768 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-10 15:26:03,768 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,768 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2223#false} #95#return; {2223#false} is VALID [2020-07-10 15:26:03,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {2222#true} call ULTIMATE.init(); {2270#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:03,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {2270#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2222#true} is VALID [2020-07-10 15:26:03,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,770 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2222#true} {2222#true} #85#return; {2222#true} is VALID [2020-07-10 15:26:03,770 INFO L263 TraceCheckUtils]: 4: Hoare triple {2222#true} call #t~ret13 := main(); {2222#true} is VALID [2020-07-10 15:26:03,771 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {2222#true} is VALID [2020-07-10 15:26:03,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,773 INFO L263 TraceCheckUtils]: 7: Hoare triple {2227#(<= 2 ~N~0)} call init_nondet(~#x~0.base, ~#x~0.offset); {2271#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:03,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {2271#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2222#true} is VALID [2020-07-10 15:26:03,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2222#true} is VALID [2020-07-10 15:26:03,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {2222#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#true} is VALID [2020-07-10 15:26:03,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {2222#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2222#true} is VALID [2020-07-10 15:26:03,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {2222#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#true} is VALID [2020-07-10 15:26:03,774 INFO L280 TraceCheckUtils]: 13: Hoare triple {2222#true} assume !(~i~0 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,775 INFO L280 TraceCheckUtils]: 14: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,776 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #89#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,776 INFO L280 TraceCheckUtils]: 16: Hoare triple {2227#(<= 2 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,776 INFO L263 TraceCheckUtils]: 17: Hoare triple {2227#(<= 2 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {2222#true} is VALID [2020-07-10 15:26:03,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {2222#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2222#true} is VALID [2020-07-10 15:26:03,777 INFO L280 TraceCheckUtils]: 19: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,777 INFO L280 TraceCheckUtils]: 20: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,777 INFO L280 TraceCheckUtils]: 21: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,777 INFO L280 TraceCheckUtils]: 22: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,778 INFO L280 TraceCheckUtils]: 23: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,778 INFO L280 TraceCheckUtils]: 24: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,778 INFO L280 TraceCheckUtils]: 25: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,778 INFO L280 TraceCheckUtils]: 26: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-10 15:26:03,778 INFO L280 TraceCheckUtils]: 27: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,779 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #91#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,780 INFO L280 TraceCheckUtils]: 29: Hoare triple {2227#(<= 2 ~N~0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,780 INFO L263 TraceCheckUtils]: 30: Hoare triple {2227#(<= 2 ~N~0)} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {2222#true} is VALID [2020-07-10 15:26:03,780 INFO L280 TraceCheckUtils]: 31: Hoare triple {2222#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2222#true} is VALID [2020-07-10 15:26:03,781 INFO L280 TraceCheckUtils]: 32: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,781 INFO L280 TraceCheckUtils]: 33: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,781 INFO L280 TraceCheckUtils]: 35: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,781 INFO L280 TraceCheckUtils]: 36: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,782 INFO L280 TraceCheckUtils]: 37: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,782 INFO L280 TraceCheckUtils]: 38: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,782 INFO L280 TraceCheckUtils]: 39: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-10 15:26:03,782 INFO L280 TraceCheckUtils]: 40: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,783 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #93#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:03,785 INFO L280 TraceCheckUtils]: 42: Hoare triple {2227#(<= 2 ~N~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2258#(and (= 0 main_~i~2) (<= 2 ~N~0))} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 43: Hoare triple {2258#(and (= 0 main_~i~2) (<= 2 ~N~0))} assume !(~i~2 < ~N~0 - 1); {2223#false} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 44: Hoare triple {2223#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {2223#false} is VALID [2020-07-10 15:26:03,786 INFO L263 TraceCheckUtils]: 45: Hoare triple {2223#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {2222#true} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 46: Hoare triple {2222#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2222#true} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 47: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 48: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 49: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 50: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 51: Hoare triple {2222#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2222#true} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 52: Hoare triple {2222#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2222#true} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 53: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 54: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 55: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-10 15:26:03,788 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2222#true} {2223#false} #95#return; {2223#false} is VALID [2020-07-10 15:26:03,789 INFO L280 TraceCheckUtils]: 57: Hoare triple {2223#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2223#false} is VALID [2020-07-10 15:26:03,789 INFO L280 TraceCheckUtils]: 58: Hoare triple {2223#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2223#false} is VALID [2020-07-10 15:26:03,789 INFO L280 TraceCheckUtils]: 59: Hoare triple {2223#false} assume !false; {2223#false} is VALID [2020-07-10 15:26:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-07-10 15:26:03,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613776262] [2020-07-10 15:26:03,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:03,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:26:03,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400552609] [2020-07-10 15:26:03,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-07-10 15:26:03,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:03,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:26:03,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:26:03,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:03,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:26:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:03,838 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 6 states. [2020-07-10 15:26:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,395 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2020-07-10 15:26:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:26:04,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-07-10 15:26:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-07-10 15:26:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-07-10 15:26:04,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2020-07-10 15:26:04,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:04,485 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:26:04,486 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 15:26:04,486 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:26:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 15:26:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-10 15:26:04,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:04,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2020-07-10 15:26:04,537 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2020-07-10 15:26:04,537 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2020-07-10 15:26:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,540 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 15:26:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 15:26:04,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,542 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2020-07-10 15:26:04,542 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2020-07-10 15:26:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,546 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 15:26:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 15:26:04,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:04,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:26:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2020-07-10 15:26:04,550 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 60 [2020-07-10 15:26:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:04,550 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2020-07-10 15:26:04,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:26:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-10 15:26:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-10 15:26:04,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:04,552 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:04,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:26:04,553 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -619650601, now seen corresponding path program 1 times [2020-07-10 15:26:04,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:04,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005735367] [2020-07-10 15:26:04,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {2589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2537#true} is VALID [2020-07-10 15:26:04,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-10 15:26:04,800 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #85#return; {2537#true} is VALID [2020-07-10 15:26:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {2590#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2537#true} is VALID [2020-07-10 15:26:04,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2537#true} is VALID [2020-07-10 15:26:04,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2537#true} is VALID [2020-07-10 15:26:04,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {2537#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2537#true} is VALID [2020-07-10 15:26:04,816 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2537#true} is VALID [2020-07-10 15:26:04,816 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !(~i~0 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-10 15:26:04,817 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2537#true} {2537#true} #89#return; {2537#true} is VALID [2020-07-10 15:26:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {2537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2537#true} is VALID [2020-07-10 15:26:04,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,858 INFO L280 TraceCheckUtils]: 3: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,859 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,859 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,859 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,859 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,861 INFO L280 TraceCheckUtils]: 8: Hoare triple {2537#true} assume !(0 != ~cnt~0);#res := 0; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,861 INFO L280 TraceCheckUtils]: 9: Hoare triple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} assume true; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,863 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} {2537#true} #91#return; {2561#(= 0 |main_#t~ret5|)} is VALID [2020-07-10 15:26:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {2537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2537#true} is VALID [2020-07-10 15:26:04,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {2537#true} assume !(0 != ~cnt~0);#res := 0; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,893 INFO L280 TraceCheckUtils]: 9: Hoare triple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} assume true; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,895 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} {2562#(= 0 main_~ret~1)} #93#return; {2574#(and (= main_~ret~1 |main_#t~ret8|) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {2537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2537#true} is VALID [2020-07-10 15:26:04,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,923 INFO L280 TraceCheckUtils]: 3: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,924 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {2537#true} assume !(0 != ~cnt~0);#res := 0; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} assume true; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,928 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} #95#return; {2587#(and (= main_~ret~1 main_~ret2~0) (= |main_#t~ret12| main_~ret~1))} is VALID [2020-07-10 15:26:04,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:04,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {2589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2537#true} is VALID [2020-07-10 15:26:04,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-10 15:26:04,930 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #85#return; {2537#true} is VALID [2020-07-10 15:26:04,930 INFO L263 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret13 := main(); {2537#true} is VALID [2020-07-10 15:26:04,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {2537#true} is VALID [2020-07-10 15:26:04,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,931 INFO L263 TraceCheckUtils]: 7: Hoare triple {2537#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2590#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:04,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {2590#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2537#true} is VALID [2020-07-10 15:26:04,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {2537#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2537#true} is VALID [2020-07-10 15:26:04,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {2537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2537#true} is VALID [2020-07-10 15:26:04,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {2537#true} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2537#true} is VALID [2020-07-10 15:26:04,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {2537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2537#true} is VALID [2020-07-10 15:26:04,933 INFO L280 TraceCheckUtils]: 13: Hoare triple {2537#true} assume !(~i~0 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-10 15:26:04,933 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2537#true} {2537#true} #89#return; {2537#true} is VALID [2020-07-10 15:26:04,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {2537#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2537#true} is VALID [2020-07-10 15:26:04,933 INFO L263 TraceCheckUtils]: 17: Hoare triple {2537#true} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {2537#true} is VALID [2020-07-10 15:26:04,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {2537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2537#true} is VALID [2020-07-10 15:26:04,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,934 INFO L280 TraceCheckUtils]: 20: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,934 INFO L280 TraceCheckUtils]: 21: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,934 INFO L280 TraceCheckUtils]: 22: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,935 INFO L280 TraceCheckUtils]: 23: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,935 INFO L280 TraceCheckUtils]: 24: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,935 INFO L280 TraceCheckUtils]: 25: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,936 INFO L280 TraceCheckUtils]: 26: Hoare triple {2537#true} assume !(0 != ~cnt~0);#res := 0; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,937 INFO L280 TraceCheckUtils]: 27: Hoare triple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} assume true; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,938 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} {2537#true} #91#return; {2561#(= 0 |main_#t~ret5|)} is VALID [2020-07-10 15:26:04,940 INFO L280 TraceCheckUtils]: 29: Hoare triple {2561#(= 0 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2562#(= 0 main_~ret~1)} is VALID [2020-07-10 15:26:04,940 INFO L263 TraceCheckUtils]: 30: Hoare triple {2562#(= 0 main_~ret~1)} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {2537#true} is VALID [2020-07-10 15:26:04,940 INFO L280 TraceCheckUtils]: 31: Hoare triple {2537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2537#true} is VALID [2020-07-10 15:26:04,940 INFO L280 TraceCheckUtils]: 32: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,941 INFO L280 TraceCheckUtils]: 33: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,941 INFO L280 TraceCheckUtils]: 34: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,941 INFO L280 TraceCheckUtils]: 35: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,941 INFO L280 TraceCheckUtils]: 36: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,941 INFO L280 TraceCheckUtils]: 37: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,941 INFO L280 TraceCheckUtils]: 38: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,942 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#true} assume !(0 != ~cnt~0);#res := 0; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,943 INFO L280 TraceCheckUtils]: 40: Hoare triple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} assume true; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,945 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} {2562#(= 0 main_~ret~1)} #93#return; {2574#(and (= main_~ret~1 |main_#t~ret8|) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,946 INFO L280 TraceCheckUtils]: 42: Hoare triple {2574#(and (= main_~ret~1 |main_#t~ret8|) (= 0 main_~ret~1))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,947 INFO L280 TraceCheckUtils]: 43: Hoare triple {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,948 INFO L280 TraceCheckUtils]: 44: Hoare triple {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,949 INFO L280 TraceCheckUtils]: 45: Hoare triple {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} assume !(~i~2 < ~N~0 - 1); {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,950 INFO L280 TraceCheckUtils]: 46: Hoare triple {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} is VALID [2020-07-10 15:26:04,950 INFO L263 TraceCheckUtils]: 47: Hoare triple {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {2537#true} is VALID [2020-07-10 15:26:04,950 INFO L280 TraceCheckUtils]: 48: Hoare triple {2537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2537#true} is VALID [2020-07-10 15:26:04,950 INFO L280 TraceCheckUtils]: 49: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,950 INFO L280 TraceCheckUtils]: 50: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,951 INFO L280 TraceCheckUtils]: 51: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,951 INFO L280 TraceCheckUtils]: 52: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,951 INFO L280 TraceCheckUtils]: 53: Hoare triple {2537#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2537#true} is VALID [2020-07-10 15:26:04,951 INFO L280 TraceCheckUtils]: 54: Hoare triple {2537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2537#true} is VALID [2020-07-10 15:26:04,951 INFO L280 TraceCheckUtils]: 55: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-10 15:26:04,952 INFO L280 TraceCheckUtils]: 56: Hoare triple {2537#true} assume !(0 != ~cnt~0);#res := 0; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,953 INFO L280 TraceCheckUtils]: 57: Hoare triple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} assume true; {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} is VALID [2020-07-10 15:26:04,954 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2591#(and (<= |rangesum_#res| 0) (<= 0 |rangesum_#res|))} {2575#(and (= main_~ret~1 main_~ret2~0) (= 0 main_~ret~1))} #95#return; {2587#(and (= main_~ret~1 main_~ret2~0) (= |main_#t~ret12| main_~ret~1))} is VALID [2020-07-10 15:26:04,955 INFO L280 TraceCheckUtils]: 59: Hoare triple {2587#(and (= main_~ret~1 main_~ret2~0) (= |main_#t~ret12| main_~ret~1))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2588#(and (= main_~ret~1 main_~ret2~0) (= main_~ret~1 main_~ret5~0))} is VALID [2020-07-10 15:26:04,956 INFO L280 TraceCheckUtils]: 60: Hoare triple {2588#(and (= main_~ret~1 main_~ret2~0) (= main_~ret~1 main_~ret5~0))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2538#false} is VALID [2020-07-10 15:26:04,956 INFO L280 TraceCheckUtils]: 61: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2020-07-10 15:26:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-07-10 15:26:04,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005735367] [2020-07-10 15:26:04,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:04,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 15:26:04,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285035146] [2020-07-10 15:26:04,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-10 15:26:04,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:04,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:26:05,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:05,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:26:05,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:05,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:26:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:05,019 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2020-07-10 15:26:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,366 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2020-07-10 15:26:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:26:06,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-10 15:26:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-10 15:26:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-10 15:26:06,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 73 transitions. [2020-07-10 15:26:06,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:06,486 INFO L225 Difference]: With dead ends: 74 [2020-07-10 15:26:06,486 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 15:26:06,487 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:26:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 15:26:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2020-07-10 15:26:06,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:06,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 56 states. [2020-07-10 15:26:06,549 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 56 states. [2020-07-10 15:26:06,550 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 56 states. [2020-07-10 15:26:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,556 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-10 15:26:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-10 15:26:06,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,557 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 70 states. [2020-07-10 15:26:06,557 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 70 states. [2020-07-10 15:26:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,561 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-10 15:26:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-10 15:26:06,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:06,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:26:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2020-07-10 15:26:06,565 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 62 [2020-07-10 15:26:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:06,566 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-07-10 15:26:06,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:26:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2020-07-10 15:26:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-10 15:26:06,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:06,567 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:06,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:26:06,568 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1679269433, now seen corresponding path program 1 times [2020-07-10 15:26:06,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:06,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284160860] [2020-07-10 15:26:06,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:06,604 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:06,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103661350] [2020-07-10 15:26:06,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:06,981 INFO L263 TraceCheckUtils]: 0: Hoare triple {2922#true} call ULTIMATE.init(); {2922#true} is VALID [2020-07-10 15:26:06,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {2922#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2922#true} is VALID [2020-07-10 15:26:06,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {2922#true} assume true; {2922#true} is VALID [2020-07-10 15:26:06,982 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2922#true} {2922#true} #85#return; {2922#true} is VALID [2020-07-10 15:26:06,982 INFO L263 TraceCheckUtils]: 4: Hoare triple {2922#true} call #t~ret13 := main(); {2922#true} is VALID [2020-07-10 15:26:06,983 INFO L280 TraceCheckUtils]: 5: Hoare triple {2922#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {2922#true} is VALID [2020-07-10 15:26:06,983 INFO L280 TraceCheckUtils]: 6: Hoare triple {2922#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {2922#true} is VALID [2020-07-10 15:26:06,983 INFO L263 TraceCheckUtils]: 7: Hoare triple {2922#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2922#true} is VALID [2020-07-10 15:26:06,984 INFO L280 TraceCheckUtils]: 8: Hoare triple {2922#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2951#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:06,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {2951#(<= init_nondet_~i~0 0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2951#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:06,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {2951#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2958#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:06,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {2958#(<= init_nondet_~i~0 1)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2958#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:06,987 INFO L280 TraceCheckUtils]: 12: Hoare triple {2958#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2965#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:06,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {2965#(<= init_nondet_~i~0 2)} assume !(~i~0 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,990 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2969#(<= ~N~0 2)} {2922#true} #89#return; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,990 INFO L280 TraceCheckUtils]: 16: Hoare triple {2969#(<= ~N~0 2)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,992 INFO L263 TraceCheckUtils]: 17: Hoare triple {2969#(<= ~N~0 2)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {2969#(<= ~N~0 2)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {2969#(<= ~N~0 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,996 INFO L280 TraceCheckUtils]: 24: Hoare triple {2969#(<= ~N~0 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,998 INFO L280 TraceCheckUtils]: 26: Hoare triple {2969#(<= ~N~0 2)} assume !(0 != ~cnt~0);#res := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,998 INFO L280 TraceCheckUtils]: 27: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:06,999 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2969#(<= ~N~0 2)} {2969#(<= ~N~0 2)} #91#return; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,000 INFO L280 TraceCheckUtils]: 29: Hoare triple {2969#(<= ~N~0 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,001 INFO L263 TraceCheckUtils]: 30: Hoare triple {2969#(<= ~N~0 2)} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,001 INFO L280 TraceCheckUtils]: 31: Hoare triple {2969#(<= ~N~0 2)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,002 INFO L280 TraceCheckUtils]: 32: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,002 INFO L280 TraceCheckUtils]: 33: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,003 INFO L280 TraceCheckUtils]: 34: Hoare triple {2969#(<= ~N~0 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,003 INFO L280 TraceCheckUtils]: 35: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,003 INFO L280 TraceCheckUtils]: 36: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,004 INFO L280 TraceCheckUtils]: 37: Hoare triple {2969#(<= ~N~0 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,005 INFO L280 TraceCheckUtils]: 38: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,005 INFO L280 TraceCheckUtils]: 39: Hoare triple {2969#(<= ~N~0 2)} assume !(0 != ~cnt~0);#res := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,006 INFO L280 TraceCheckUtils]: 40: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,007 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2969#(<= ~N~0 2)} {2969#(<= ~N~0 2)} #93#return; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,007 INFO L280 TraceCheckUtils]: 42: Hoare triple {2969#(<= ~N~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,008 INFO L280 TraceCheckUtils]: 43: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,008 INFO L280 TraceCheckUtils]: 44: Hoare triple {2969#(<= ~N~0 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,009 INFO L280 TraceCheckUtils]: 45: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~2 < ~N~0 - 1); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,009 INFO L280 TraceCheckUtils]: 46: Hoare triple {2969#(<= ~N~0 2)} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,010 INFO L263 TraceCheckUtils]: 47: Hoare triple {2969#(<= ~N~0 2)} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {2969#(<= ~N~0 2)} is VALID [2020-07-10 15:26:07,011 INFO L280 TraceCheckUtils]: 48: Hoare triple {2969#(<= ~N~0 2)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3075#(and (<= ~N~0 2) (<= 0 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,012 INFO L280 TraceCheckUtils]: 49: Hoare triple {3075#(and (<= ~N~0 2) (<= 0 rangesum_~i~1))} assume !!(~i~1 < ~N~0); {3075#(and (<= ~N~0 2) (<= 0 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,013 INFO L280 TraceCheckUtils]: 50: Hoare triple {3075#(and (<= ~N~0 2) (<= 0 rangesum_~i~1))} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3075#(and (<= ~N~0 2) (<= 0 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,014 INFO L280 TraceCheckUtils]: 51: Hoare triple {3075#(and (<= ~N~0 2) (<= 0 rangesum_~i~1))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3085#(and (<= ~N~0 2) (<= 1 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,015 INFO L280 TraceCheckUtils]: 52: Hoare triple {3085#(and (<= ~N~0 2) (<= 1 rangesum_~i~1))} assume !!(~i~1 < ~N~0); {3085#(and (<= ~N~0 2) (<= 1 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,016 INFO L280 TraceCheckUtils]: 53: Hoare triple {3085#(and (<= ~N~0 2) (<= 1 rangesum_~i~1))} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3085#(and (<= ~N~0 2) (<= 1 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,017 INFO L280 TraceCheckUtils]: 54: Hoare triple {3085#(and (<= ~N~0 2) (<= 1 rangesum_~i~1))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3095#(and (<= ~N~0 2) (<= 2 rangesum_~i~1))} is VALID [2020-07-10 15:26:07,018 INFO L280 TraceCheckUtils]: 55: Hoare triple {3095#(and (<= ~N~0 2) (<= 2 rangesum_~i~1))} assume !!(~i~1 < ~N~0); {2923#false} is VALID [2020-07-10 15:26:07,018 INFO L280 TraceCheckUtils]: 56: Hoare triple {2923#false} assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2923#false} is VALID [2020-07-10 15:26:07,018 INFO L280 TraceCheckUtils]: 57: Hoare triple {2923#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2923#false} is VALID [2020-07-10 15:26:07,019 INFO L280 TraceCheckUtils]: 58: Hoare triple {2923#false} assume !(~i~1 < ~N~0); {2923#false} is VALID [2020-07-10 15:26:07,019 INFO L280 TraceCheckUtils]: 59: Hoare triple {2923#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2923#false} is VALID [2020-07-10 15:26:07,019 INFO L280 TraceCheckUtils]: 60: Hoare triple {2923#false} assume true; {2923#false} is VALID [2020-07-10 15:26:07,019 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2923#false} {2969#(<= ~N~0 2)} #95#return; {2923#false} is VALID [2020-07-10 15:26:07,019 INFO L280 TraceCheckUtils]: 62: Hoare triple {2923#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2923#false} is VALID [2020-07-10 15:26:07,019 INFO L280 TraceCheckUtils]: 63: Hoare triple {2923#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2923#false} is VALID [2020-07-10 15:26:07,020 INFO L280 TraceCheckUtils]: 64: Hoare triple {2923#false} assume !false; {2923#false} is VALID [2020-07-10 15:26:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-10 15:26:07,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284160860] [2020-07-10 15:26:07,030 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:07,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103661350] [2020-07-10 15:26:07,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:07,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:26:07,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10642284] [2020-07-10 15:26:07,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-10 15:26:07,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:07,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:26:07,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:26:07,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:26:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:26:07,115 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 9 states. [2020-07-10 15:26:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,689 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2020-07-10 15:26:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:26:07,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-10 15:26:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:26:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-10 15:26:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:26:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-10 15:26:07,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2020-07-10 15:26:07,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,851 INFO L225 Difference]: With dead ends: 120 [2020-07-10 15:26:07,851 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:26:07,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:26:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:26:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-10 15:26:07,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:07,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2020-07-10 15:26:07,926 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2020-07-10 15:26:07,926 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2020-07-10 15:26:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,929 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-10 15:26:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-07-10 15:26:07,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,930 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2020-07-10 15:26:07,931 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2020-07-10 15:26:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,933 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-10 15:26:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-07-10 15:26:07,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:07,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:26:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2020-07-10 15:26:07,937 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 65 [2020-07-10 15:26:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:07,937 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2020-07-10 15:26:07,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:26:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-10 15:26:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 15:26:07,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:07,939 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:08,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:08,153 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2040052581, now seen corresponding path program 2 times [2020-07-10 15:26:08,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:08,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659183811] [2020-07-10 15:26:08,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {3547#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3493#true} is VALID [2020-07-10 15:26:08,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-10 15:26:08,246 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3493#true} {3493#true} #85#return; {3493#true} is VALID [2020-07-10 15:26:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {3548#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3549#(<= 0 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {3549#(<= 0 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3549#(<= 0 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {3549#(<= 0 init_nondet_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3550#(<= 1 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {3550#(<= 1 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3550#(<= 1 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {3550#(<= 1 init_nondet_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3551#(<= 2 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {3551#(<= 2 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,313 INFO L280 TraceCheckUtils]: 6: Hoare triple {3508#(<= 3 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {3508#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {3508#(<= 3 ~N~0)} assume true; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,315 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3508#(<= 3 ~N~0)} {3493#true} #89#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {3493#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3493#true} is VALID [2020-07-10 15:26:08,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {3493#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3493#true} is VALID [2020-07-10 15:26:08,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {3493#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3493#true} is VALID [2020-07-10 15:26:08,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {3493#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3493#true} is VALID [2020-07-10 15:26:08,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {3493#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3493#true} is VALID [2020-07-10 15:26:08,326 INFO L280 TraceCheckUtils]: 7: Hoare triple {3493#true} assume !(~i~1 < ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,326 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} assume !(0 != ~cnt~0);#res := 0; {3493#true} is VALID [2020-07-10 15:26:08,326 INFO L280 TraceCheckUtils]: 9: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-10 15:26:08,328 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3493#true} {3508#(<= 3 ~N~0)} #91#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {3493#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3493#true} is VALID [2020-07-10 15:26:08,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {3493#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3493#true} is VALID [2020-07-10 15:26:08,339 INFO L280 TraceCheckUtils]: 3: Hoare triple {3493#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3493#true} is VALID [2020-07-10 15:26:08,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,339 INFO L280 TraceCheckUtils]: 5: Hoare triple {3493#true} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3493#true} is VALID [2020-07-10 15:26:08,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {3493#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3493#true} is VALID [2020-07-10 15:26:08,339 INFO L280 TraceCheckUtils]: 7: Hoare triple {3493#true} assume !(~i~1 < ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,340 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} assume !(0 != ~cnt~0);#res := 0; {3493#true} is VALID [2020-07-10 15:26:08,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-10 15:26:08,341 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3493#true} {3508#(<= 3 ~N~0)} #93#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659183811] [2020-07-10 15:26:08,344 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-10 15:26:08,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41118461] [2020-07-10 15:26:08,345 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:08,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:08,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:08,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:08,683 INFO L263 TraceCheckUtils]: 0: Hoare triple {3493#true} call ULTIMATE.init(); {3493#true} is VALID [2020-07-10 15:26:08,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3493#true} is VALID [2020-07-10 15:26:08,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-10 15:26:08,684 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3493#true} {3493#true} #85#return; {3493#true} is VALID [2020-07-10 15:26:08,684 INFO L263 TraceCheckUtils]: 4: Hoare triple {3493#true} call #t~ret13 := main(); {3493#true} is VALID [2020-07-10 15:26:08,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {3493#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {3493#true} is VALID [2020-07-10 15:26:08,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {3493#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {3493#true} is VALID [2020-07-10 15:26:08,685 INFO L263 TraceCheckUtils]: 7: Hoare triple {3493#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3493#true} is VALID [2020-07-10 15:26:08,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3549#(<= 0 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {3549#(<= 0 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3549#(<= 0 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,693 INFO L280 TraceCheckUtils]: 10: Hoare triple {3549#(<= 0 init_nondet_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3550#(<= 1 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {3550#(<= 1 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3550#(<= 1 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,694 INFO L280 TraceCheckUtils]: 12: Hoare triple {3550#(<= 1 init_nondet_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3551#(<= 2 init_nondet_~i~0)} is VALID [2020-07-10 15:26:08,695 INFO L280 TraceCheckUtils]: 13: Hoare triple {3551#(<= 2 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,695 INFO L280 TraceCheckUtils]: 14: Hoare triple {3508#(<= 3 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,696 INFO L280 TraceCheckUtils]: 15: Hoare triple {3508#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,696 INFO L280 TraceCheckUtils]: 16: Hoare triple {3508#(<= 3 ~N~0)} assume true; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,697 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3508#(<= 3 ~N~0)} {3493#true} #89#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,697 INFO L280 TraceCheckUtils]: 18: Hoare triple {3508#(<= 3 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,698 INFO L263 TraceCheckUtils]: 19: Hoare triple {3508#(<= 3 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {3508#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:08,698 INFO L280 TraceCheckUtils]: 20: Hoare triple {3508#(<= 3 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3615#(and (<= 3 ~N~0) (<= rangesum_~i~1 0))} is VALID [2020-07-10 15:26:08,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {3615#(and (<= 3 ~N~0) (<= rangesum_~i~1 0))} assume !!(~i~1 < ~N~0); {3615#(and (<= 3 ~N~0) (<= rangesum_~i~1 0))} is VALID [2020-07-10 15:26:08,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {3615#(and (<= 3 ~N~0) (<= rangesum_~i~1 0))} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3615#(and (<= 3 ~N~0) (<= rangesum_~i~1 0))} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 23: Hoare triple {3615#(and (<= 3 ~N~0) (<= rangesum_~i~1 0))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3625#(and (<= 3 ~N~0) (<= rangesum_~i~1 1))} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 24: Hoare triple {3625#(and (<= 3 ~N~0) (<= rangesum_~i~1 1))} assume !!(~i~1 < ~N~0); {3625#(and (<= 3 ~N~0) (<= rangesum_~i~1 1))} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 25: Hoare triple {3625#(and (<= 3 ~N~0) (<= rangesum_~i~1 1))} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3625#(and (<= 3 ~N~0) (<= rangesum_~i~1 1))} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 26: Hoare triple {3625#(and (<= 3 ~N~0) (<= rangesum_~i~1 1))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3635#(and (<= 3 ~N~0) (<= rangesum_~i~1 2))} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 27: Hoare triple {3635#(and (<= 3 ~N~0) (<= rangesum_~i~1 2))} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 28: Hoare triple {3494#false} assume !(0 != ~cnt~0);#res := 0; {3494#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 29: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-10 15:26:08,706 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3494#false} {3508#(<= 3 ~N~0)} #91#return; {3494#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 31: Hoare triple {3494#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3494#false} is VALID [2020-07-10 15:26:08,706 INFO L263 TraceCheckUtils]: 32: Hoare triple {3494#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 33: Hoare triple {3494#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 34: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 35: Hoare triple {3494#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 36: Hoare triple {3494#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 37: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 38: Hoare triple {3494#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3494#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 39: Hoare triple {3494#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 40: Hoare triple {3494#false} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 41: Hoare triple {3494#false} assume !(0 != ~cnt~0);#res := 0; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 42: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3494#false} {3494#false} #93#return; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 44: Hoare triple {3494#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 45: Hoare triple {3494#false} assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 46: Hoare triple {3494#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3494#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 47: Hoare triple {3494#false} assume !(~i~2 < ~N~0 - 1); {3494#false} is VALID [2020-07-10 15:26:08,709 INFO L280 TraceCheckUtils]: 48: Hoare triple {3494#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {3494#false} is VALID [2020-07-10 15:26:08,709 INFO L263 TraceCheckUtils]: 49: Hoare triple {3494#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {3494#false} is VALID [2020-07-10 15:26:08,709 INFO L280 TraceCheckUtils]: 50: Hoare triple {3494#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3494#false} is VALID [2020-07-10 15:26:08,709 INFO L280 TraceCheckUtils]: 51: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,709 INFO L280 TraceCheckUtils]: 52: Hoare triple {3494#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3494#false} is VALID [2020-07-10 15:26:08,709 INFO L280 TraceCheckUtils]: 53: Hoare triple {3494#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3494#false} is VALID [2020-07-10 15:26:08,710 INFO L280 TraceCheckUtils]: 54: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,710 INFO L280 TraceCheckUtils]: 55: Hoare triple {3494#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3494#false} is VALID [2020-07-10 15:26:08,710 INFO L280 TraceCheckUtils]: 56: Hoare triple {3494#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3494#false} is VALID [2020-07-10 15:26:08,710 INFO L280 TraceCheckUtils]: 57: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,710 INFO L280 TraceCheckUtils]: 58: Hoare triple {3494#false} assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3494#false} is VALID [2020-07-10 15:26:08,711 INFO L280 TraceCheckUtils]: 59: Hoare triple {3494#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3494#false} is VALID [2020-07-10 15:26:08,711 INFO L280 TraceCheckUtils]: 60: Hoare triple {3494#false} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-10 15:26:08,711 INFO L280 TraceCheckUtils]: 61: Hoare triple {3494#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3494#false} is VALID [2020-07-10 15:26:08,711 INFO L280 TraceCheckUtils]: 62: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-10 15:26:08,711 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3494#false} {3494#false} #95#return; {3494#false} is VALID [2020-07-10 15:26:08,712 INFO L280 TraceCheckUtils]: 64: Hoare triple {3494#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3494#false} is VALID [2020-07-10 15:26:08,712 INFO L280 TraceCheckUtils]: 65: Hoare triple {3494#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3494#false} is VALID [2020-07-10 15:26:08,712 INFO L280 TraceCheckUtils]: 66: Hoare triple {3494#false} assume !false; {3494#false} is VALID [2020-07-10 15:26:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-10 15:26:08,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:08,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:26:08,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240714767] [2020-07-10 15:26:08,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-10 15:26:08,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:08,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:26:08,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:08,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:26:08,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:08,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:26:08,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:26:08,801 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 9 states. [2020-07-10 15:26:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,315 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-10 15:26:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:26:09,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-10 15:26:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:26:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-10 15:26:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:26:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-10 15:26:09,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-10 15:26:09,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:09,439 INFO L225 Difference]: With dead ends: 99 [2020-07-10 15:26:09,439 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 15:26:09,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 15:26:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2020-07-10 15:26:09,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:09,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 60 states. [2020-07-10 15:26:09,520 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 60 states. [2020-07-10 15:26:09,521 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 60 states. [2020-07-10 15:26:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,524 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2020-07-10 15:26:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-07-10 15:26:09,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:09,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:09,525 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 63 states. [2020-07-10 15:26:09,525 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 63 states. [2020-07-10 15:26:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,528 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2020-07-10 15:26:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-07-10 15:26:09,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:09,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:09,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:09,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 15:26:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2020-07-10 15:26:09,532 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 67 [2020-07-10 15:26:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:09,532 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2020-07-10 15:26:09,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:26:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-07-10 15:26:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-10 15:26:09,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:09,548 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:09,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-10 15:26:09,749 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -737365673, now seen corresponding path program 1 times [2020-07-10 15:26:09,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:09,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937260692] [2020-07-10 15:26:09,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:09,766 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:09,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300322169] [2020-07-10 15:26:09,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:09,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:26:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:09,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:10,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {4104#true} call ULTIMATE.init(); {4104#true} is VALID [2020-07-10 15:26:10,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {4104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {4104#true} is VALID [2020-07-10 15:26:10,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {4104#true} assume true; {4104#true} is VALID [2020-07-10 15:26:10,047 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4104#true} {4104#true} #85#return; {4104#true} is VALID [2020-07-10 15:26:10,047 INFO L263 TraceCheckUtils]: 4: Hoare triple {4104#true} call #t~ret13 := main(); {4104#true} is VALID [2020-07-10 15:26:10,047 INFO L280 TraceCheckUtils]: 5: Hoare triple {4104#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {4104#true} is VALID [2020-07-10 15:26:10,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {4104#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0); {4104#true} is VALID [2020-07-10 15:26:10,048 INFO L263 TraceCheckUtils]: 7: Hoare triple {4104#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4104#true} is VALID [2020-07-10 15:26:10,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {4104#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4133#(<= 0 init_nondet_~i~0)} is VALID [2020-07-10 15:26:10,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {4133#(<= 0 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4133#(<= 0 init_nondet_~i~0)} is VALID [2020-07-10 15:26:10,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {4133#(<= 0 init_nondet_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4140#(<= 1 init_nondet_~i~0)} is VALID [2020-07-10 15:26:10,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {4140#(<= 1 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4140#(<= 1 init_nondet_~i~0)} is VALID [2020-07-10 15:26:10,054 INFO L280 TraceCheckUtils]: 12: Hoare triple {4140#(<= 1 init_nondet_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= 2 init_nondet_~i~0)} is VALID [2020-07-10 15:26:10,056 INFO L280 TraceCheckUtils]: 13: Hoare triple {4147#(<= 2 init_nondet_~i~0)} assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,057 INFO L280 TraceCheckUtils]: 14: Hoare triple {4151#(<= 3 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,058 INFO L280 TraceCheckUtils]: 15: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,058 INFO L280 TraceCheckUtils]: 16: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,059 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4151#(<= 3 ~N~0)} {4104#true} #89#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,060 INFO L280 TraceCheckUtils]: 18: Hoare triple {4151#(<= 3 ~N~0)} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,061 INFO L263 TraceCheckUtils]: 19: Hoare triple {4151#(<= 3 ~N~0)} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {4151#(<= 3 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,063 INFO L280 TraceCheckUtils]: 21: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,063 INFO L280 TraceCheckUtils]: 22: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,064 INFO L280 TraceCheckUtils]: 23: Hoare triple {4151#(<= 3 ~N~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,065 INFO L280 TraceCheckUtils]: 24: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,065 INFO L280 TraceCheckUtils]: 25: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,066 INFO L280 TraceCheckUtils]: 26: Hoare triple {4151#(<= 3 ~N~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,067 INFO L280 TraceCheckUtils]: 27: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,067 INFO L280 TraceCheckUtils]: 28: Hoare triple {4151#(<= 3 ~N~0)} assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,068 INFO L280 TraceCheckUtils]: 29: Hoare triple {4151#(<= 3 ~N~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,069 INFO L280 TraceCheckUtils]: 30: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,070 INFO L280 TraceCheckUtils]: 31: Hoare triple {4151#(<= 3 ~N~0)} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,071 INFO L280 TraceCheckUtils]: 32: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,072 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4151#(<= 3 ~N~0)} {4151#(<= 3 ~N~0)} #91#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,073 INFO L280 TraceCheckUtils]: 34: Hoare triple {4151#(<= 3 ~N~0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,074 INFO L263 TraceCheckUtils]: 35: Hoare triple {4151#(<= 3 ~N~0)} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,075 INFO L280 TraceCheckUtils]: 36: Hoare triple {4151#(<= 3 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,076 INFO L280 TraceCheckUtils]: 37: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,077 INFO L280 TraceCheckUtils]: 38: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,078 INFO L280 TraceCheckUtils]: 39: Hoare triple {4151#(<= 3 ~N~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,078 INFO L280 TraceCheckUtils]: 40: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,079 INFO L280 TraceCheckUtils]: 41: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,080 INFO L280 TraceCheckUtils]: 42: Hoare triple {4151#(<= 3 ~N~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,081 INFO L280 TraceCheckUtils]: 43: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,082 INFO L280 TraceCheckUtils]: 44: Hoare triple {4151#(<= 3 ~N~0)} assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,083 INFO L280 TraceCheckUtils]: 45: Hoare triple {4151#(<= 3 ~N~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,084 INFO L280 TraceCheckUtils]: 46: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,085 INFO L280 TraceCheckUtils]: 47: Hoare triple {4151#(<= 3 ~N~0)} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,086 INFO L280 TraceCheckUtils]: 48: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,088 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4151#(<= 3 ~N~0)} {4151#(<= 3 ~N~0)} #93#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-10 15:26:10,089 INFO L280 TraceCheckUtils]: 50: Hoare triple {4151#(<= 3 ~N~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4263#(and (<= 3 ~N~0) (<= main_~i~2 0))} is VALID [2020-07-10 15:26:10,090 INFO L280 TraceCheckUtils]: 51: Hoare triple {4263#(and (<= 3 ~N~0) (<= main_~i~2 0))} assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4263#(and (<= 3 ~N~0) (<= main_~i~2 0))} is VALID [2020-07-10 15:26:10,092 INFO L280 TraceCheckUtils]: 52: Hoare triple {4263#(and (<= 3 ~N~0) (<= main_~i~2 0))} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4270#(and (<= 3 ~N~0) (<= main_~i~2 1))} is VALID [2020-07-10 15:26:10,094 INFO L280 TraceCheckUtils]: 53: Hoare triple {4270#(and (<= 3 ~N~0) (<= main_~i~2 1))} assume !(~i~2 < ~N~0 - 1); {4105#false} is VALID [2020-07-10 15:26:10,094 INFO L280 TraceCheckUtils]: 54: Hoare triple {4105#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {4105#false} is VALID [2020-07-10 15:26:10,094 INFO L263 TraceCheckUtils]: 55: Hoare triple {4105#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {4105#false} is VALID [2020-07-10 15:26:10,094 INFO L280 TraceCheckUtils]: 56: Hoare triple {4105#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4105#false} is VALID [2020-07-10 15:26:10,095 INFO L280 TraceCheckUtils]: 57: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-10 15:26:10,095 INFO L280 TraceCheckUtils]: 58: Hoare triple {4105#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4105#false} is VALID [2020-07-10 15:26:10,095 INFO L280 TraceCheckUtils]: 59: Hoare triple {4105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4105#false} is VALID [2020-07-10 15:26:10,095 INFO L280 TraceCheckUtils]: 60: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-10 15:26:10,095 INFO L280 TraceCheckUtils]: 61: Hoare triple {4105#false} assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4105#false} is VALID [2020-07-10 15:26:10,095 INFO L280 TraceCheckUtils]: 62: Hoare triple {4105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4105#false} is VALID [2020-07-10 15:26:10,096 INFO L280 TraceCheckUtils]: 63: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-10 15:26:10,096 INFO L280 TraceCheckUtils]: 64: Hoare triple {4105#false} assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4105#false} is VALID [2020-07-10 15:26:10,096 INFO L280 TraceCheckUtils]: 65: Hoare triple {4105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4105#false} is VALID [2020-07-10 15:26:10,096 INFO L280 TraceCheckUtils]: 66: Hoare triple {4105#false} assume !(~i~1 < ~N~0); {4105#false} is VALID [2020-07-10 15:26:10,097 INFO L280 TraceCheckUtils]: 67: Hoare triple {4105#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4105#false} is VALID [2020-07-10 15:26:10,097 INFO L280 TraceCheckUtils]: 68: Hoare triple {4105#false} assume true; {4105#false} is VALID [2020-07-10 15:26:10,097 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4105#false} {4105#false} #95#return; {4105#false} is VALID [2020-07-10 15:26:10,097 INFO L280 TraceCheckUtils]: 70: Hoare triple {4105#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4105#false} is VALID [2020-07-10 15:26:10,098 INFO L280 TraceCheckUtils]: 71: Hoare triple {4105#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4105#false} is VALID [2020-07-10 15:26:10,098 INFO L280 TraceCheckUtils]: 72: Hoare triple {4105#false} assume !false; {4105#false} is VALID [2020-07-10 15:26:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2020-07-10 15:26:10,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937260692] [2020-07-10 15:26:10,103 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:10,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300322169] [2020-07-10 15:26:10,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:10,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:26:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698491175] [2020-07-10 15:26:10,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-10 15:26:10,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:10,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:26:10,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:10,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:26:10,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:10,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:26:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:26:10,197 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 8 states. [2020-07-10 15:26:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,684 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2020-07-10 15:26:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:26:10,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-10 15:26:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:26:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-10 15:26:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:26:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-10 15:26:10,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2020-07-10 15:26:10,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:10,782 INFO L225 Difference]: With dead ends: 94 [2020-07-10 15:26:10,783 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:26:10,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:26:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:26:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-10 15:26:10,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:10,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-10 15:26:10,863 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-10 15:26:10,863 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-10 15:26:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,868 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-10 15:26:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-10 15:26:10,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:10,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:10,869 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-10 15:26:10,870 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-10 15:26:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,875 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-10 15:26:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-10 15:26:10,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:10,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:10,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:10,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:26:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2020-07-10 15:26:10,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 73 [2020-07-10 15:26:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:10,879 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2020-07-10 15:26:10,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:26:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-07-10 15:26:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-10 15:26:10,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:10,880 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:11,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-10 15:26:11,094 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 132738585, now seen corresponding path program 2 times [2020-07-10 15:26:11,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:11,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690113903] [2020-07-10 15:26:11,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:11,107 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:11,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191481094] [2020-07-10 15:26:11,108 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:11,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-10 15:26:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:11,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:11,494 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:11,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:11,789 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:26:11,790 WARN L170 areAnnotationChecker]: L7-4 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 15:26:11,791 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-10 15:26:11,792 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:26:11,793 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:26:11,793 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:26:11,793 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 15:26:11,793 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:26:11,793 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:26:11,793 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:11,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:11 BoogieIcfgContainer [2020-07-10 15:26:11,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:11,799 INFO L168 Benchmark]: Toolchain (without parser) took 18184.36 ms. Allocated memory was 145.8 MB in the beginning and 338.2 MB in the end (delta: 192.4 MB). Free memory was 103.5 MB in the beginning and 100.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 195.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,799 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.51 ms. Allocated memory is still 145.8 MB. Free memory was 103.3 MB in the beginning and 92.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,800 INFO L168 Benchmark]: Boogie Preprocessor took 139.50 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.1 MB in the beginning and 181.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,801 INFO L168 Benchmark]: RCFGBuilder took 619.74 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 150.4 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,801 INFO L168 Benchmark]: TraceAbstraction took 17119.66 ms. Allocated memory was 203.4 MB in the beginning and 338.2 MB in the end (delta: 134.7 MB). Free memory was 149.7 MB in the beginning and 100.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 184.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,804 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.29 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.51 ms. Allocated memory is still 145.8 MB. Free memory was 103.3 MB in the beginning and 92.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.50 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.1 MB in the beginning and 181.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 619.74 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 150.4 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17119.66 ms. Allocated memory was 203.4 MB in the beginning and 338.2 MB in the end (delta: 134.7 MB). Free memory was 149.7 MB in the beginning and 100.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 184.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int N; VAL [\old(N)=5, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={2:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={2:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={2:0}, x={2:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={2:0}, x={2:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={2:0}, x={2:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={2:0}, x={2:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={2:0}, x={2:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={2:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={2:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={2:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147483647, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=2147483647, x={2:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=2147483647, temp=2147483645, x={2:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={2:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147483647, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=2147483647, ret=2147483647, temp=2147483645, x={2:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=2147483647, ret2=2147483647, temp=2147483646, x={2:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147483646, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483646, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483646, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147483646, cnt=1, i=3, N=3, ret=2147483646, x={2:0}, x={2:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=2147483646, ret=2147483647, ret2=2147483647, temp=2147483646, x={2:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=2147483647, ret2=2147483647, ret5=2147483646, temp=2147483646, x={2:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=2147483647, ret2=2147483647, ret5=2147483646, temp=2147483646, x={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 12, TraceHistogramMax: 9, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 329 SDtfs, 369 SDslu, 525 SDs, 0 SdLazy, 939 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 453 SyntacticMatches, 10 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 887 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 74591 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 677/727 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 incorrect! Received shutdown request...