/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-46f3038-m [2020-07-08 12:44:13,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:13,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:13,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:13,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:13,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:13,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:13,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:13,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:13,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:13,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:13,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:13,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:13,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:13,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:13,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:13,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:13,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:13,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:13,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:13,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:13,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:13,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:13,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:13,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:13,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:13,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:13,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:13,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:13,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:13,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:13,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:13,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:13,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:13,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:13,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:13,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:13,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:13,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:13,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:13,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:13,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:44:13,271 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:13,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:13,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:13,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:13,273 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:13,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:13,274 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:13,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:13,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:13,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:13,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:13,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:13,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:13,275 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:13,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:13,276 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:13,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:13,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:13,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:13,277 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:13,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:13,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:13,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:13,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:13,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:13,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:13,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:13,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:13,279 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:13,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:13,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:13,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:13,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:13,621 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:13,622 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:13,623 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum.i [2020-07-08 12:44:13,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de862e420/ba2d73924da64e22a91d2ffabab8c597/FLAGd9ecd8da0 [2020-07-08 12:44:14,299 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:14,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i [2020-07-08 12:44:14,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de862e420/ba2d73924da64e22a91d2ffabab8c597/FLAGd9ecd8da0 [2020-07-08 12:44:14,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de862e420/ba2d73924da64e22a91d2ffabab8c597 [2020-07-08 12:44:14,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:14,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:14,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:14,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:14,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:14,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:14" (1/1) ... [2020-07-08 12:44:14,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30653709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:14, skipping insertion in model container [2020-07-08 12:44:14,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:14" (1/1) ... [2020-07-08 12:44:14,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:14,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:14,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:14,952 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:14,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:15,088 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:15,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15 WrapperNode [2020-07-08 12:44:15,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:15,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:15,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:15,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:15,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:15,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:15,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:15,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:15,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2020-07-08 12:44:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2020-07-08 12:44:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2020-07-08 12:44:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2020-07-08 12:44:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:44:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:15,956 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:15,957 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:44:15,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:15 BoogieIcfgContainer [2020-07-08 12:44:15,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:15,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:15,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:15,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:14" (1/3) ... [2020-07-08 12:44:15,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23de7a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:15, skipping insertion in model container [2020-07-08 12:44:15,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (2/3) ... [2020-07-08 12:44:15,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23de7a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:15, skipping insertion in model container [2020-07-08 12:44:15,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:15" (3/3) ... [2020-07-08 12:44:15,971 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum.i [2020-07-08 12:44:15,982 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:15,989 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:16,004 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:16,029 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:16,029 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:16,029 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:16,030 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:16,030 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:16,030 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:16,030 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:16,030 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-08 12:44:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:44:16,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:16,057 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-08 12:44:16,057 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1377249276, now seen corresponding path program 1 times [2020-07-08 12:44:16,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:16,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547366038] [2020-07-08 12:44:16,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,311 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-08 12:44:16,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-08 12:44:16,312 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #85#return; {42#true} is VALID [2020-07-08 12:44:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,341 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-08 12:44:16,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-08 12:44:16,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-08 12:44:16,343 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #89#return; {43#false} is VALID [2020-07-08 12:44:16,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547366038] [2020-07-08 12:44:16,350 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-08 12:44:16,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182806867] [2020-07-08 12:44:16,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-08 12:44:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:16,544 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2020-07-08 12:44:16,544 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-08 12:44:16,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-08 12:44:16,545 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #85#return; {42#true} is VALID [2020-07-08 12:44:16,546 INFO L263 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2020-07-08 12:44:16,546 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-08 12:44:16,546 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-08 12:44:16,547 INFO L263 TraceCheckUtils]: 7: Hoare triple {42#true} call init_nondet(~#x~0.base, ~#x~0.offset); {42#true} is VALID [2020-07-08 12:44:16,547 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-08 12:44:16,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-08 12:44:16,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-08 12:44:16,549 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {43#false} {42#true} #89#return; {43#false} is VALID [2020-07-08 12:44:16,549 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-08 12:44:16,550 INFO L263 TraceCheckUtils]: 13: Hoare triple {43#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-08 12:44:16,550 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-08 12:44:16,550 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-08 12:44:16,551 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-08 12:44:16,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-08 12:44:16,552 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {43#false} {43#false} #91#return; {43#false} is VALID [2020-07-08 12:44:16,552 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-08 12:44:16,553 INFO L263 TraceCheckUtils]: 20: Hoare triple {43#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-08 12:44:16,553 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-08 12:44:16,553 INFO L280 TraceCheckUtils]: 22: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-08 12:44:16,554 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-08 12:44:16,554 INFO L280 TraceCheckUtils]: 24: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-08 12:44:16,554 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {43#false} {43#false} #93#return; {43#false} is VALID [2020-07-08 12:44:16,555 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-08 12:44:16,555 INFO L280 TraceCheckUtils]: 27: Hoare triple {43#false} assume !(~i~2 < ~N~0 - 1); {43#false} is VALID [2020-07-08 12:44:16,556 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-08 12:44:16,556 INFO L263 TraceCheckUtils]: 29: Hoare triple {43#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-08 12:44:16,556 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-08 12:44:16,557 INFO L280 TraceCheckUtils]: 31: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-08 12:44:16,557 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-08 12:44:16,558 INFO L280 TraceCheckUtils]: 33: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-08 12:44:16,558 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {43#false} {43#false} #95#return; {43#false} is VALID [2020-07-08 12:44:16,558 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-08 12:44:16,559 INFO L280 TraceCheckUtils]: 36: Hoare triple {43#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {43#false} is VALID [2020-07-08 12:44:16,559 INFO L280 TraceCheckUtils]: 37: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-08 12:44:16,565 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-08 12:44:16,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:16,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:44:16,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66009447] [2020-07-08 12:44:16,576 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2020-07-08 12:44:16,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:16,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:44:16,646 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-08 12:44:16,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:44:16,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:44:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:44:16,660 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2020-07-08 12:44:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:16,795 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2020-07-08 12:44:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:44:16,795 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2020-07-08 12:44:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:44:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2020-07-08 12:44:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:44:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2020-07-08 12:44:16,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2020-07-08 12:44:16,956 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-08 12:44:16,970 INFO L225 Difference]: With dead ends: 67 [2020-07-08 12:44:16,970 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:44:16,974 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-08 12:44:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:44:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 12:44:17,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:17,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:17,028 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:17,028 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:17,035 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-08 12:44:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-08 12:44:17,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:17,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:17,037 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:17,037 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:17,042 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-08 12:44:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-08 12:44:17,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:17,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:17,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:17,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:44:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-07-08 12:44:17,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2020-07-08 12:44:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:17,051 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-08 12:44:17,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:44:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-08 12:44:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:44:17,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:17,053 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-08 12:44:17,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-08 12:44:17,268 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1240892162, now seen corresponding path program 1 times [2020-07-08 12:44:17,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:17,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061529706] [2020-07-08 12:44:17,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:17,299 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:17,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784257022] [2020-07-08 12:44:17,301 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-08 12:44:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:17,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:44:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:17,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:17,455 INFO L263 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2020-07-08 12:44:17,455 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-08 12:44:17,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-08 12:44:17,456 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #85#return; {379#true} is VALID [2020-07-08 12:44:17,456 INFO L263 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret13 := main(); {379#true} is VALID [2020-07-08 12:44:17,456 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-08 12:44:17,457 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-08 12:44:17,462 INFO L263 TraceCheckUtils]: 7: Hoare triple {379#true} call init_nondet(~#x~0.base, ~#x~0.offset); {379#true} is VALID [2020-07-08 12:44:17,463 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-08 12:44:17,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {379#true} assume !(~i~0 < ~N~0); {379#true} is VALID [2020-07-08 12:44:17,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-08 12:44:17,464 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {379#true} {379#true} #89#return; {379#true} is VALID [2020-07-08 12:44:17,464 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-08 12:44:17,464 INFO L263 TraceCheckUtils]: 13: Hoare triple {379#true} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {379#true} is VALID [2020-07-08 12:44:17,466 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-08 12:44:17,467 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-08 12:44:17,468 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-08 12:44:17,468 INFO L280 TraceCheckUtils]: 17: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-08 12:44:17,469 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {380#false} {379#true} #91#return; {380#false} is VALID [2020-07-08 12:44:17,469 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-08 12:44:17,472 INFO L263 TraceCheckUtils]: 20: Hoare triple {380#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {380#false} is VALID [2020-07-08 12:44:17,472 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-08 12:44:17,472 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#false} assume !(~i~1 < ~N~0); {380#false} is VALID [2020-07-08 12:44:17,472 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-08 12:44:17,473 INFO L280 TraceCheckUtils]: 24: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-08 12:44:17,473 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {380#false} {380#false} #93#return; {380#false} is VALID [2020-07-08 12:44:17,474 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-08 12:44:17,474 INFO L280 TraceCheckUtils]: 27: Hoare triple {380#false} assume !(~i~2 < ~N~0 - 1); {380#false} is VALID [2020-07-08 12:44:17,474 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-08 12:44:17,474 INFO L263 TraceCheckUtils]: 29: Hoare triple {380#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {380#false} is VALID [2020-07-08 12:44:17,475 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-08 12:44:17,475 INFO L280 TraceCheckUtils]: 31: Hoare triple {380#false} assume !(~i~1 < ~N~0); {380#false} is VALID [2020-07-08 12:44:17,475 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-08 12:44:17,476 INFO L280 TraceCheckUtils]: 33: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-08 12:44:17,476 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {380#false} {380#false} #95#return; {380#false} is VALID [2020-07-08 12:44:17,476 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-08 12:44:17,477 INFO L280 TraceCheckUtils]: 36: Hoare triple {380#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {380#false} is VALID [2020-07-08 12:44:17,477 INFO L280 TraceCheckUtils]: 37: Hoare triple {380#false} assume !false; {380#false} is VALID [2020-07-08 12:44:17,479 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-08 12:44:17,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061529706] [2020-07-08 12:44:17,480 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:17,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784257022] [2020-07-08 12:44:17,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:17,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:17,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405811652] [2020-07-08 12:44:17,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-08 12:44:17,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:17,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:17,526 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-08 12:44:17,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:17,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:17,528 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2020-07-08 12:44:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:17,932 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2020-07-08 12:44:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:17,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-08 12:44:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2020-07-08 12:44:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2020-07-08 12:44:17,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2020-07-08 12:44:18,068 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-08 12:44:18,075 INFO L225 Difference]: With dead ends: 57 [2020-07-08 12:44:18,075 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 12:44:18,077 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-08 12:44:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 12:44:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-08 12:44:18,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:18,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-08 12:44:18,103 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-08 12:44:18,104 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-08 12:44:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,115 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-08 12:44:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-08 12:44:18,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:18,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:18,118 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-08 12:44:18,119 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-08 12:44:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,126 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-08 12:44:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-08 12:44:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:18,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:18,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:18,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 12:44:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-07-08 12:44:18,145 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2020-07-08 12:44:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:18,148 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-07-08 12:44:18,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-08 12:44:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:44:18,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:18,151 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-08 12:44:18,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:18,358 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1742767491, now seen corresponding path program 1 times [2020-07-08 12:44:18,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:18,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691742793] [2020-07-08 12:44:18,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,456 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-08 12:44:18,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {700#true} {700#true} #85#return; {700#true} is VALID [2020-07-08 12:44:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,504 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-08 12:44:18,506 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-08 12:44:18,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {728#(<= ~N~0 0)} assume true; {728#(<= ~N~0 0)} is VALID [2020-07-08 12:44:18,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {728#(<= ~N~0 0)} {705#(<= 2 ~N~0)} #89#return; {701#false} is VALID [2020-07-08 12:44:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,520 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-08 12:44:18,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-08 12:44:18,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-08 12:44:18,522 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,522 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #91#return; {701#false} is VALID [2020-07-08 12:44:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,531 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-08 12:44:18,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-08 12:44:18,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-08 12:44:18,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,533 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #93#return; {701#false} is VALID [2020-07-08 12:44:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,543 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-08 12:44:18,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-08 12:44:18,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-08 12:44:18,545 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,545 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #95#return; {701#false} is VALID [2020-07-08 12:44:18,547 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-08 12:44:18,548 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-08 12:44:18,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,549 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {700#true} {700#true} #85#return; {700#true} is VALID [2020-07-08 12:44:18,549 INFO L263 TraceCheckUtils]: 4: Hoare triple {700#true} call #t~ret13 := main(); {700#true} is VALID [2020-07-08 12:44:18,550 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-08 12:44:18,551 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-08 12:44:18,553 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-08 12:44:18,554 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-08 12:44:18,555 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-08 12:44:18,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {728#(<= ~N~0 0)} assume true; {728#(<= ~N~0 0)} is VALID [2020-07-08 12:44:18,559 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {728#(<= ~N~0 0)} {705#(<= 2 ~N~0)} #89#return; {701#false} is VALID [2020-07-08 12:44:18,559 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-08 12:44:18,560 INFO L263 TraceCheckUtils]: 13: Hoare triple {701#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-08 12:44:18,560 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-08 12:44:18,560 INFO L280 TraceCheckUtils]: 15: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-08 12:44:18,561 INFO L280 TraceCheckUtils]: 16: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-08 12:44:18,561 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,561 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {700#true} {701#false} #91#return; {701#false} is VALID [2020-07-08 12:44:18,562 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-08 12:44:18,562 INFO L263 TraceCheckUtils]: 20: Hoare triple {701#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-08 12:44:18,562 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-08 12:44:18,563 INFO L280 TraceCheckUtils]: 22: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-08 12:44:18,563 INFO L280 TraceCheckUtils]: 23: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-08 12:44:18,563 INFO L280 TraceCheckUtils]: 24: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,564 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {700#true} {701#false} #93#return; {701#false} is VALID [2020-07-08 12:44:18,579 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-08 12:44:18,580 INFO L280 TraceCheckUtils]: 27: Hoare triple {701#false} assume !(~i~2 < ~N~0 - 1); {701#false} is VALID [2020-07-08 12:44:18,580 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-08 12:44:18,580 INFO L263 TraceCheckUtils]: 29: Hoare triple {701#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-08 12:44:18,581 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-08 12:44:18,581 INFO L280 TraceCheckUtils]: 31: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-08 12:44:18,581 INFO L280 TraceCheckUtils]: 32: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-08 12:44:18,581 INFO L280 TraceCheckUtils]: 33: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-08 12:44:18,582 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {700#true} {701#false} #95#return; {701#false} is VALID [2020-07-08 12:44:18,582 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-08 12:44:18,582 INFO L280 TraceCheckUtils]: 36: Hoare triple {701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {701#false} is VALID [2020-07-08 12:44:18,582 INFO L280 TraceCheckUtils]: 37: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-08 12:44:18,585 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-08 12:44:18,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691742793] [2020-07-08 12:44:18,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:18,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:44:18,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418457234] [2020-07-08 12:44:18,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 12:44:18,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:18,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:44:18,639 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-08 12:44:18,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:44:18,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:18,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:44:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:44:18,641 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 7 states. [2020-07-08 12:44:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:19,496 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-07-08 12:44:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 12:44:19,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 12:44:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:44:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-08 12:44:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:44:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-08 12:44:19,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2020-07-08 12:44:19,609 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-08 12:44:19,611 INFO L225 Difference]: With dead ends: 65 [2020-07-08 12:44:19,612 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 12:44:19,613 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-08 12:44:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 12:44:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-08 12:44:19,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:19,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-08 12:44:19,658 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-08 12:44:19,658 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-08 12:44:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:19,662 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-08 12:44:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-08 12:44:19,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:19,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:19,664 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-08 12:44:19,664 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-08 12:44:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:19,667 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-08 12:44:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-08 12:44:19,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:19,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:19,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:19,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 12:44:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-08 12:44:19,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 38 [2020-07-08 12:44:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:19,672 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-08 12:44:19,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:44:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-08 12:44:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 12:44:19,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:19,674 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-08 12:44:19,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:44:19,675 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash 558201179, now seen corresponding path program 1 times [2020-07-08 12:44:19,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:19,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125659154] [2020-07-08 12:44:19,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,763 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-08 12:44:19,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,764 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-08 12:44:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,821 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-08 12:44:19,822 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-08 12:44:19,824 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-08 12:44:19,825 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-08 12:44:19,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#(<= ~N~0 1)} assume true; {997#(<= ~N~0 1)} is VALID [2020-07-08 12:44:19,827 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {997#(<= ~N~0 1)} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-08 12:44:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,835 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-08 12:44:19,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-08 12:44:19,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-08 12:44:19,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,836 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #91#return; {967#false} is VALID [2020-07-08 12:44:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,843 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-08 12:44:19,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-08 12:44:19,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-08 12:44:19,844 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,844 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #93#return; {967#false} is VALID [2020-07-08 12:44:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,852 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-08 12:44:19,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-08 12:44:19,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-08 12:44:19,853 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,853 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #95#return; {967#false} is VALID [2020-07-08 12:44:19,855 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-08 12:44:19,855 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-08 12:44:19,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,855 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-08 12:44:19,856 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret13 := main(); {966#true} is VALID [2020-07-08 12:44:19,856 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-08 12:44:19,857 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-08 12:44:19,858 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-08 12:44:19,859 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-08 12:44:19,860 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-08 12:44:19,861 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-08 12:44:19,862 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-08 12:44:19,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {997#(<= ~N~0 1)} assume true; {997#(<= ~N~0 1)} is VALID [2020-07-08 12:44:19,864 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {997#(<= ~N~0 1)} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-08 12:44:19,864 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-08 12:44:19,864 INFO L263 TraceCheckUtils]: 15: Hoare triple {967#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-08 12:44:19,865 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-08 12:44:19,865 INFO L280 TraceCheckUtils]: 17: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-08 12:44:19,865 INFO L280 TraceCheckUtils]: 18: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-08 12:44:19,865 INFO L280 TraceCheckUtils]: 19: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,866 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {966#true} {967#false} #91#return; {967#false} is VALID [2020-07-08 12:44:19,866 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-08 12:44:19,866 INFO L263 TraceCheckUtils]: 22: Hoare triple {967#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-08 12:44:19,866 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-08 12:44:19,867 INFO L280 TraceCheckUtils]: 24: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-08 12:44:19,867 INFO L280 TraceCheckUtils]: 25: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-08 12:44:19,867 INFO L280 TraceCheckUtils]: 26: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,867 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {966#true} {967#false} #93#return; {967#false} is VALID [2020-07-08 12:44:19,868 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-08 12:44:19,868 INFO L280 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(~i~2 < ~N~0 - 1); {967#false} is VALID [2020-07-08 12:44:19,868 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-08 12:44:19,868 INFO L263 TraceCheckUtils]: 31: Hoare triple {967#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-08 12:44:19,869 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-08 12:44:19,869 INFO L280 TraceCheckUtils]: 33: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-08 12:44:19,869 INFO L280 TraceCheckUtils]: 34: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-08 12:44:19,869 INFO L280 TraceCheckUtils]: 35: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:19,870 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {966#true} {967#false} #95#return; {967#false} is VALID [2020-07-08 12:44:19,870 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-08 12:44:19,870 INFO L280 TraceCheckUtils]: 38: Hoare triple {967#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {967#false} is VALID [2020-07-08 12:44:19,870 INFO L280 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-08 12:44:19,873 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-08 12:44:19,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125659154] [2020-07-08 12:44:19,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531457603] [2020-07-08 12:44:19,874 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-08 12:44:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:44:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:20,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-08 12:44:20,049 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-08 12:44:20,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:44:20,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-08 12:44:20,050 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret13 := main(); {966#true} is VALID [2020-07-08 12:44:20,050 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-08 12:44:20,052 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-08 12:44:20,053 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-08 12:44:20,054 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-08 12:44:20,055 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-08 12:44:20,056 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-08 12:44:20,057 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-08 12:44:20,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-08 12:44:20,057 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {967#false} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-08 12:44:20,058 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-08 12:44:20,058 INFO L263 TraceCheckUtils]: 15: Hoare triple {967#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-08 12:44:20,058 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-08 12:44:20,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-08 12:44:20,059 INFO L280 TraceCheckUtils]: 18: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-08 12:44:20,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-08 12:44:20,059 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {967#false} {967#false} #91#return; {967#false} is VALID [2020-07-08 12:44:20,059 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-08 12:44:20,060 INFO L263 TraceCheckUtils]: 22: Hoare triple {967#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-08 12:44:20,060 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-08 12:44:20,060 INFO L280 TraceCheckUtils]: 24: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-08 12:44:20,060 INFO L280 TraceCheckUtils]: 25: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-08 12:44:20,061 INFO L280 TraceCheckUtils]: 26: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-08 12:44:20,061 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {967#false} {967#false} #93#return; {967#false} is VALID [2020-07-08 12:44:20,061 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-08 12:44:20,061 INFO L280 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(~i~2 < ~N~0 - 1); {967#false} is VALID [2020-07-08 12:44:20,062 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-08 12:44:20,062 INFO L263 TraceCheckUtils]: 31: Hoare triple {967#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-08 12:44:20,062 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-08 12:44:20,062 INFO L280 TraceCheckUtils]: 33: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-08 12:44:20,063 INFO L280 TraceCheckUtils]: 34: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-08 12:44:20,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-08 12:44:20,063 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {967#false} {967#false} #95#return; {967#false} is VALID [2020-07-08 12:44:20,063 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-08 12:44:20,064 INFO L280 TraceCheckUtils]: 38: Hoare triple {967#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {967#false} is VALID [2020-07-08 12:44:20,064 INFO L280 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-08 12:44:20,066 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-08 12:44:20,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:44:20,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2020-07-08 12:44:20,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684994295] [2020-07-08 12:44:20,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-08 12:44:20,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:20,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:44:20,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:20,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:44:20,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:44:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:44:20,137 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-07-08 12:44:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:21,234 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2020-07-08 12:44:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 12:44:21,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-08 12:44:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:44:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-07-08 12:44:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:44:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-07-08 12:44:21,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2020-07-08 12:44:21,350 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-08 12:44:21,352 INFO L225 Difference]: With dead ends: 67 [2020-07-08 12:44:21,352 INFO L226 Difference]: Without dead ends: 41 [2020-07-08 12:44:21,355 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-08 12:44:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-08 12:44:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-07-08 12:44:21,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:21,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2020-07-08 12:44:21,399 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2020-07-08 12:44:21,399 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2020-07-08 12:44:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:21,403 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-08 12:44:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-08 12:44:21,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:21,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:21,404 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2020-07-08 12:44:21,404 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2020-07-08 12:44:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:21,408 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-08 12:44:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-08 12:44:21,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:21,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:21,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:21,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 12:44:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-08 12:44:21,412 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 40 [2020-07-08 12:44:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:21,412 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-08 12:44:21,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:44:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-08 12:44:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 12:44:21,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:21,414 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-08 12:44:21,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:21,629 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash -119064391, now seen corresponding path program 2 times [2020-07-08 12:44:21,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:21,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927930353] [2020-07-08 12:44:21,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,706 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-08 12:44:21,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,707 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-08 12:44:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,727 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-08 12:44:21,727 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-08 12:44:21,728 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-08 12:44:21,728 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-08 12:44:21,728 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-08 12:44:21,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} assume !(~i~0 < ~N~0); {1366#true} is VALID [2020-07-08 12:44:21,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,730 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1366#true} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,758 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-08 12:44:21,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {1397#(<= rangesum_~i~1 0)} assume !(~i~1 < ~N~0); {1398#(<= ~N~0 0)} is VALID [2020-07-08 12:44:21,760 INFO L280 TraceCheckUtils]: 2: Hoare triple {1398#(<= ~N~0 0)} assume !(0 != ~cnt~0);#res := 0; {1398#(<= ~N~0 0)} is VALID [2020-07-08 12:44:21,761 INFO L280 TraceCheckUtils]: 3: Hoare triple {1398#(<= ~N~0 0)} assume true; {1398#(<= ~N~0 0)} is VALID [2020-07-08 12:44:21,762 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1398#(<= ~N~0 0)} {1371#(<= 2 ~N~0)} #91#return; {1367#false} is VALID [2020-07-08 12:44:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,775 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-08 12:44:21,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-08 12:44:21,776 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-08 12:44:21,776 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,777 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1366#true} {1367#false} #93#return; {1367#false} is VALID [2020-07-08 12:44:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,792 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-08 12:44:21,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-08 12:44:21,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-08 12:44:21,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,794 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1366#true} {1367#false} #95#return; {1367#false} is VALID [2020-07-08 12:44:21,795 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-08 12:44:21,796 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-08 12:44:21,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,796 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-08 12:44:21,796 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2020-07-08 12:44:21,796 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-08 12:44:21,798 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-08 12:44:21,799 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-08 12:44:21,800 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-08 12:44:21,800 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-08 12:44:21,800 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-08 12:44:21,800 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-08 12:44:21,801 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-08 12:44:21,801 INFO L280 TraceCheckUtils]: 13: Hoare triple {1366#true} assume !(~i~0 < ~N~0); {1366#true} is VALID [2020-07-08 12:44:21,801 INFO L280 TraceCheckUtils]: 14: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,802 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1366#true} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,802 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-08 12:44:21,803 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-08 12:44:21,803 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-08 12:44:21,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {1397#(<= rangesum_~i~1 0)} assume !(~i~1 < ~N~0); {1398#(<= ~N~0 0)} is VALID [2020-07-08 12:44:21,805 INFO L280 TraceCheckUtils]: 20: Hoare triple {1398#(<= ~N~0 0)} assume !(0 != ~cnt~0);#res := 0; {1398#(<= ~N~0 0)} is VALID [2020-07-08 12:44:21,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {1398#(<= ~N~0 0)} assume true; {1398#(<= ~N~0 0)} is VALID [2020-07-08 12:44:21,807 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1398#(<= ~N~0 0)} {1371#(<= 2 ~N~0)} #91#return; {1367#false} is VALID [2020-07-08 12:44:21,807 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-08 12:44:21,807 INFO L263 TraceCheckUtils]: 24: Hoare triple {1367#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-08 12:44:21,808 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-08 12:44:21,808 INFO L280 TraceCheckUtils]: 26: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-08 12:44:21,808 INFO L280 TraceCheckUtils]: 27: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-08 12:44:21,808 INFO L280 TraceCheckUtils]: 28: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,809 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1366#true} {1367#false} #93#return; {1367#false} is VALID [2020-07-08 12:44:21,809 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-08 12:44:21,809 INFO L280 TraceCheckUtils]: 31: Hoare triple {1367#false} assume !(~i~2 < ~N~0 - 1); {1367#false} is VALID [2020-07-08 12:44:21,809 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-08 12:44:21,810 INFO L263 TraceCheckUtils]: 33: Hoare triple {1367#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-08 12:44:21,810 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-08 12:44:21,810 INFO L280 TraceCheckUtils]: 35: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-08 12:44:21,810 INFO L280 TraceCheckUtils]: 36: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-08 12:44:21,810 INFO L280 TraceCheckUtils]: 37: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,811 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1366#true} {1367#false} #95#return; {1367#false} is VALID [2020-07-08 12:44:21,811 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-08 12:44:21,813 INFO L280 TraceCheckUtils]: 40: Hoare triple {1367#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1367#false} is VALID [2020-07-08 12:44:21,813 INFO L280 TraceCheckUtils]: 41: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-08 12:44:21,814 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-08 12:44:21,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927930353] [2020-07-08 12:44:21,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624347965] [2020-07-08 12:44:21,815 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-08 12:44:21,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:44:21,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:21,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:44:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:21,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:21,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2020-07-08 12:44:21,965 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-08 12:44:21,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-08 12:44:21,966 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-08 12:44:21,966 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2020-07-08 12:44:21,967 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-08 12:44:21,969 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-08 12:44:21,970 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-08 12:44:21,971 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-08 12:44:21,972 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-08 12:44:21,972 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-08 12:44:21,973 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-08 12:44:21,974 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-08 12:44:21,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,975 INFO L280 TraceCheckUtils]: 14: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,977 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,978 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-08 12:44:21,979 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-08 12:44:21,980 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-08 12:44:21,981 INFO L280 TraceCheckUtils]: 19: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~1 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,982 INFO L280 TraceCheckUtils]: 20: Hoare triple {1371#(<= 2 ~N~0)} assume !(0 != ~cnt~0);#res := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,983 INFO L280 TraceCheckUtils]: 21: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,985 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #91#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,986 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-08 12:44:21,987 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-08 12:44:21,988 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-08 12:44:21,988 INFO L280 TraceCheckUtils]: 26: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~1 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,989 INFO L280 TraceCheckUtils]: 27: Hoare triple {1371#(<= 2 ~N~0)} assume !(0 != ~cnt~0);#res := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,990 INFO L280 TraceCheckUtils]: 28: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,991 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #93#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,992 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-08 12:44:21,993 INFO L280 TraceCheckUtils]: 31: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~2 < ~N~0 - 1); {1371#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:21,994 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-08 12:44:21,995 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-08 12:44:21,996 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-08 12:44:21,997 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-08 12:44:21,997 INFO L280 TraceCheckUtils]: 36: Hoare triple {1367#false} assume !(0 != ~cnt~0);#res := 0; {1367#false} is VALID [2020-07-08 12:44:21,998 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} assume true; {1367#false} is VALID [2020-07-08 12:44:21,998 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1367#false} {1371#(<= 2 ~N~0)} #95#return; {1367#false} is VALID [2020-07-08 12:44:21,998 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-08 12:44:21,999 INFO L280 TraceCheckUtils]: 40: Hoare triple {1367#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1367#false} is VALID [2020-07-08 12:44:21,999 INFO L280 TraceCheckUtils]: 41: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-08 12:44:22,004 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-08 12:44:22,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:22,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2020-07-08 12:44:22,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204418224] [2020-07-08 12:44:22,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-08 12:44:22,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:22,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:44:22,075 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-08 12:44:22,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:44:22,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:44:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:44:22,076 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2020-07-08 12:44:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:22,263 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-08 12:44:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:44:22,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-08 12:44:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:44:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-08 12:44:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:44:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-08 12:44:22,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2020-07-08 12:44:22,353 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-08 12:44:22,355 INFO L225 Difference]: With dead ends: 65 [2020-07-08 12:44:22,355 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 12:44:22,356 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-08 12:44:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 12:44:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-08 12:44:22,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:22,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-08 12:44:22,401 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-08 12:44:22,402 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-08 12:44:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:22,405 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-08 12:44:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-08 12:44:22,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:22,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:22,407 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-08 12:44:22,407 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-08 12:44:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:22,410 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-08 12:44:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-08 12:44:22,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:22,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:22,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:22,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:44:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2020-07-08 12:44:22,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 42 [2020-07-08 12:44:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:22,414 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2020-07-08 12:44:22,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:44:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2020-07-08 12:44:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 12:44:22,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:22,416 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-08 12:44:22,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:22,629 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash -12268618, now seen corresponding path program 1 times [2020-07-08 12:44:22,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:22,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377634804] [2020-07-08 12:44:22,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,746 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-08 12:44:22,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,746 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-08 12:44:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,787 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-08 12:44:22,787 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-08 12:44:22,787 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-08 12:44:22,788 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-08 12:44:22,788 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-08 12:44:22,788 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(~i~0 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,789 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,837 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-08 12:44:22,838 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-08 12:44:22,839 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-08 12:44:22,846 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-08 12:44:22,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {1799#(<= rangesum_~i~1 1)} assume !(~i~1 < ~N~0); {1800#(<= ~N~0 1)} is VALID [2020-07-08 12:44:22,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {1800#(<= ~N~0 1)} assume !(0 != ~cnt~0);#res := 0; {1800#(<= ~N~0 1)} is VALID [2020-07-08 12:44:22,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {1800#(<= ~N~0 1)} assume true; {1800#(<= ~N~0 1)} is VALID [2020-07-08 12:44:22,848 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1800#(<= ~N~0 1)} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-08 12:44:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,859 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-08 12:44:22,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,860 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-08 12:44:22,860 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-08 12:44:22,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-08 12:44:22,860 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,861 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1759#false} #93#return; {1759#false} is VALID [2020-07-08 12:44:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,871 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-08 12:44:22,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,872 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-08 12:44:22,872 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-08 12:44:22,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-08 12:44:22,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,873 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1759#false} #95#return; {1759#false} is VALID [2020-07-08 12:44:22,874 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-08 12:44:22,874 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-08 12:44:22,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,875 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-08 12:44:22,875 INFO L263 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret13 := main(); {1758#true} is VALID [2020-07-08 12:44:22,875 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-08 12:44:22,876 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-08 12:44:22,878 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-08 12:44:22,878 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-08 12:44:22,878 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-08 12:44:22,879 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-08 12:44:22,879 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-08 12:44:22,879 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-08 12:44:22,879 INFO L280 TraceCheckUtils]: 13: Hoare triple {1758#true} assume !(~i~0 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,879 INFO L280 TraceCheckUtils]: 14: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,880 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1758#true} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:22,881 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-08 12:44:22,882 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-08 12:44:22,884 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-08 12:44:22,885 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-08 12:44:22,885 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-08 12:44:22,886 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-08 12:44:22,887 INFO L280 TraceCheckUtils]: 22: Hoare triple {1799#(<= rangesum_~i~1 1)} assume !(~i~1 < ~N~0); {1800#(<= ~N~0 1)} is VALID [2020-07-08 12:44:22,888 INFO L280 TraceCheckUtils]: 23: Hoare triple {1800#(<= ~N~0 1)} assume !(0 != ~cnt~0);#res := 0; {1800#(<= ~N~0 1)} is VALID [2020-07-08 12:44:22,888 INFO L280 TraceCheckUtils]: 24: Hoare triple {1800#(<= ~N~0 1)} assume true; {1800#(<= ~N~0 1)} is VALID [2020-07-08 12:44:22,889 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1800#(<= ~N~0 1)} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-08 12:44:22,889 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-08 12:44:22,890 INFO L263 TraceCheckUtils]: 27: Hoare triple {1759#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-08 12:44:22,890 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-08 12:44:22,890 INFO L280 TraceCheckUtils]: 29: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,890 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-08 12:44:22,890 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-08 12:44:22,891 INFO L280 TraceCheckUtils]: 32: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,891 INFO L280 TraceCheckUtils]: 33: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-08 12:44:22,891 INFO L280 TraceCheckUtils]: 34: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,891 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1758#true} {1759#false} #93#return; {1759#false} is VALID [2020-07-08 12:44:22,892 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-08 12:44:22,892 INFO L280 TraceCheckUtils]: 37: Hoare triple {1759#false} assume !(~i~2 < ~N~0 - 1); {1759#false} is VALID [2020-07-08 12:44:22,892 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-08 12:44:22,892 INFO L263 TraceCheckUtils]: 39: Hoare triple {1759#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-08 12:44:22,893 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-08 12:44:22,893 INFO L280 TraceCheckUtils]: 41: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,893 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-08 12:44:22,893 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-08 12:44:22,893 INFO L280 TraceCheckUtils]: 44: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-08 12:44:22,894 INFO L280 TraceCheckUtils]: 45: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-08 12:44:22,894 INFO L280 TraceCheckUtils]: 46: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:22,894 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1758#true} {1759#false} #95#return; {1759#false} is VALID [2020-07-08 12:44:22,894 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-08 12:44:22,895 INFO L280 TraceCheckUtils]: 49: Hoare triple {1759#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1759#false} is VALID [2020-07-08 12:44:22,895 INFO L280 TraceCheckUtils]: 50: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2020-07-08 12:44:22,897 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-08 12:44:22,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377634804] [2020-07-08 12:44:22,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869357760] [2020-07-08 12:44:22,897 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-08 12:44:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:44:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:23,063 INFO L263 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1758#true} is VALID [2020-07-08 12:44:23,063 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-08 12:44:23,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-08 12:44:23,064 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-08 12:44:23,064 INFO L263 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret13 := main(); {1758#true} is VALID [2020-07-08 12:44:23,064 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-08 12:44:23,065 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-08 12:44:23,066 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-08 12:44:23,066 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-08 12:44:23,067 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-08 12:44:23,068 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-08 12:44:23,068 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-08 12:44:23,070 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-08 12:44:23,070 INFO L280 TraceCheckUtils]: 13: Hoare triple {1763#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {1763#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:23,071 INFO L280 TraceCheckUtils]: 14: Hoare triple {1763#(<= 2 ~N~0)} assume true; {1763#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:23,072 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1763#(<= 2 ~N~0)} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:23,072 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-08 12:44:23,073 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-08 12:44:23,073 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-08 12:44:23,078 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-08 12:44:23,079 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-08 12:44:23,081 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-08 12:44:23,081 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-08 12:44:23,082 INFO L280 TraceCheckUtils]: 23: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-08 12:44:23,082 INFO L280 TraceCheckUtils]: 24: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-08 12:44:23,082 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1759#false} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-08 12:44:23,082 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-08 12:44:23,083 INFO L263 TraceCheckUtils]: 27: Hoare triple {1759#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1759#false} is VALID [2020-07-08 12:44:23,083 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-08 12:44:23,083 INFO L280 TraceCheckUtils]: 29: Hoare triple {1759#false} assume !!(~i~1 < ~N~0); {1759#false} is VALID [2020-07-08 12:44:23,083 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-08 12:44:23,083 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-08 12:44:23,084 INFO L280 TraceCheckUtils]: 32: Hoare triple {1759#false} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-08 12:44:23,084 INFO L280 TraceCheckUtils]: 33: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-08 12:44:23,084 INFO L280 TraceCheckUtils]: 34: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-08 12:44:23,084 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1759#false} {1759#false} #93#return; {1759#false} is VALID [2020-07-08 12:44:23,084 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-08 12:44:23,085 INFO L280 TraceCheckUtils]: 37: Hoare triple {1759#false} assume !(~i~2 < ~N~0 - 1); {1759#false} is VALID [2020-07-08 12:44:23,085 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-08 12:44:23,085 INFO L263 TraceCheckUtils]: 39: Hoare triple {1759#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1759#false} is VALID [2020-07-08 12:44:23,085 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-08 12:44:23,085 INFO L280 TraceCheckUtils]: 41: Hoare triple {1759#false} assume !!(~i~1 < ~N~0); {1759#false} is VALID [2020-07-08 12:44:23,086 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-08 12:44:23,086 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-08 12:44:23,086 INFO L280 TraceCheckUtils]: 44: Hoare triple {1759#false} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-08 12:44:23,086 INFO L280 TraceCheckUtils]: 45: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-08 12:44:23,087 INFO L280 TraceCheckUtils]: 46: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-08 12:44:23,087 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1759#false} {1759#false} #95#return; {1759#false} is VALID [2020-07-08 12:44:23,087 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-08 12:44:23,087 INFO L280 TraceCheckUtils]: 49: Hoare triple {1759#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1759#false} is VALID [2020-07-08 12:44:23,087 INFO L280 TraceCheckUtils]: 50: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2020-07-08 12:44:23,091 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-08 12:44:23,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:44:23,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2020-07-08 12:44:23,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067306564] [2020-07-08 12:44:23,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-08 12:44:23,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:23,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:44:23,194 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-08 12:44:23,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:44:23,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:44:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:44:23,195 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2020-07-08 12:44:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:24,203 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-08 12:44:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 12:44:24,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-08 12:44:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:44:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2020-07-08 12:44:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:44:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2020-07-08 12:44:24,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2020-07-08 12:44:24,307 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-08 12:44:24,310 INFO L225 Difference]: With dead ends: 70 [2020-07-08 12:44:24,311 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 12:44:24,312 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-08 12:44:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 12:44:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-08 12:44:24,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:24,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-08 12:44:24,375 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-08 12:44:24,376 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-08 12:44:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:24,378 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-08 12:44:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 12:44:24,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:24,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:24,379 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-08 12:44:24,380 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-08 12:44:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:24,383 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-08 12:44:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 12:44:24,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:24,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:24,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:24,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 12:44:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-08 12:44:24,387 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 51 [2020-07-08 12:44:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:24,387 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-08 12:44:24,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:44:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-08 12:44:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-08 12:44:24,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:24,389 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-08 12:44:24,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-08 12:44:24,604 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash 456134489, now seen corresponding path program 2 times [2020-07-08 12:44:24,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:24,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591074869] [2020-07-08 12:44:24,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,684 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-08 12:44:24,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,685 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2222#true} {2222#true} #85#return; {2222#true} is VALID [2020-07-08 12:44:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,700 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-08 12:44:24,700 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-08 12:44:24,701 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-08 12:44:24,701 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-08 12:44:24,701 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-08 12:44:24,701 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume !(~i~0 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,701 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,702 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #89#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,712 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-08 12:44:24,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,713 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-08 12:44:24,713 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-08 12:44:24,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,714 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-08 12:44:24,714 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-08 12:44:24,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-08 12:44:24,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,716 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #91#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,726 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-08 12:44:24,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,726 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-08 12:44:24,727 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-08 12:44:24,727 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,727 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-08 12:44:24,727 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-08 12:44:24,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-08 12:44:24,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,729 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #93#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,742 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-08 12:44:24,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,743 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-08 12:44:24,743 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-08 12:44:24,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,743 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-08 12:44:24,744 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-08 12:44:24,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,744 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-08 12:44:24,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,744 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2223#false} #95#return; {2223#false} is VALID [2020-07-08 12:44:24,747 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-08 12:44:24,748 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-08 12:44:24,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,748 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2222#true} {2222#true} #85#return; {2222#true} is VALID [2020-07-08 12:44:24,748 INFO L263 TraceCheckUtils]: 4: Hoare triple {2222#true} call #t~ret13 := main(); {2222#true} is VALID [2020-07-08 12:44:24,749 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-08 12:44:24,750 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-08 12:44:24,751 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-08 12:44:24,751 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-08 12:44:24,751 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-08 12:44:24,751 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-08 12:44:24,752 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-08 12:44:24,752 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-08 12:44:24,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {2222#true} assume !(~i~0 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,753 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #89#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:24,754 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-08 12:44:24,754 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-08 12:44:24,754 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-08 12:44:24,754 INFO L280 TraceCheckUtils]: 19: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,754 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-08 12:44:24,755 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-08 12:44:24,755 INFO L280 TraceCheckUtils]: 22: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,755 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-08 12:44:24,755 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-08 12:44:24,755 INFO L280 TraceCheckUtils]: 25: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,756 INFO L280 TraceCheckUtils]: 26: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-08 12:44:24,756 INFO L280 TraceCheckUtils]: 27: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,757 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #91#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:24,757 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-08 12:44:24,758 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-08 12:44:24,758 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-08 12:44:24,758 INFO L280 TraceCheckUtils]: 32: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,758 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-08 12:44:24,759 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-08 12:44:24,759 INFO L280 TraceCheckUtils]: 35: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,759 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-08 12:44:24,759 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-08 12:44:24,760 INFO L280 TraceCheckUtils]: 38: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,760 INFO L280 TraceCheckUtils]: 39: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-08 12:44:24,760 INFO L280 TraceCheckUtils]: 40: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,761 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #93#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-08 12:44:24,762 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-08 12:44:24,763 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-08 12:44:24,763 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-08 12:44:24,763 INFO L263 TraceCheckUtils]: 45: Hoare triple {2223#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {2222#true} is VALID [2020-07-08 12:44:24,763 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-08 12:44:24,764 INFO L280 TraceCheckUtils]: 47: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,764 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-08 12:44:24,764 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-08 12:44:24,764 INFO L280 TraceCheckUtils]: 50: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,765 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-08 12:44:24,765 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-08 12:44:24,765 INFO L280 TraceCheckUtils]: 53: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-08 12:44:24,765 INFO L280 TraceCheckUtils]: 54: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-08 12:44:24,765 INFO L280 TraceCheckUtils]: 55: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-08 12:44:24,766 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2222#true} {2223#false} #95#return; {2223#false} is VALID [2020-07-08 12:44:24,766 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-08 12:44:24,766 INFO L280 TraceCheckUtils]: 58: Hoare triple {2223#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2223#false} is VALID [2020-07-08 12:44:24,766 INFO L280 TraceCheckUtils]: 59: Hoare triple {2223#false} assume !false; {2223#false} is VALID [2020-07-08 12:44:24,769 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-08 12:44:24,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591074869] [2020-07-08 12:44:24,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:24,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:44:24,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991938357] [2020-07-08 12:44:24,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-07-08 12:44:24,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:24,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:44:24,818 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-08 12:44:24,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:44:24,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:44:24,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:44:24,820 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 6 states. [2020-07-08 12:44:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:25,532 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2020-07-08 12:44:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:44:25,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-07-08 12:44:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:44:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-07-08 12:44:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:44:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-07-08 12:44:25,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2020-07-08 12:44:25,628 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-08 12:44:25,630 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:44:25,631 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 12:44:25,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:44:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 12:44:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-08 12:44:25,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:25,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2020-07-08 12:44:25,693 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2020-07-08 12:44:25,693 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2020-07-08 12:44:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:25,696 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 12:44:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 12:44:25,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:25,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:25,697 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2020-07-08 12:44:25,697 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2020-07-08 12:44:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:25,700 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 12:44:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 12:44:25,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:25,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:25,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:25,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 12:44:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2020-07-08 12:44:25,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 60 [2020-07-08 12:44:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:25,704 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2020-07-08 12:44:25,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:44:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 12:44:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-08 12:44:25,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:25,705 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-08 12:44:25,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:44:25,705 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:25,706 INFO L82 PathProgramCache]: Analyzing trace with hash -619650601, now seen corresponding path program 1 times [2020-07-08 12:44:25,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:25,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632261072] [2020-07-08 12:44:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,891 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-08 12:44:25,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-08 12:44:25,892 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #85#return; {2537#true} is VALID [2020-07-08 12:44:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,918 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-08 12:44:25,918 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-08 12:44:25,918 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-08 12:44:25,919 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-08 12:44:25,919 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-08 12:44:25,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !(~i~0 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:25,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-08 12:44:25,920 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2537#true} {2537#true} #89#return; {2537#true} is VALID [2020-07-08 12:44:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,966 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-08 12:44:25,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:25,967 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-08 12:44:25,967 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-08 12:44:25,968 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:25,968 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-08 12:44:25,968 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-08 12:44:25,968 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:25,969 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-08 12:44:25,970 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-08 12:44:25,972 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-08 12:44:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:26,007 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-08 12:44:26,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,008 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-08 12:44:26,008 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-08 12:44:26,008 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,009 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-08 12:44:26,009 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-08 12:44:26,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,010 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-08 12:44:26,011 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-08 12:44:26,012 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-08 12:44:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:26,042 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-08 12:44:26,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,043 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-08 12:44:26,043 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-08 12:44:26,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,043 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-08 12:44:26,043 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-08 12:44:26,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,046 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-08 12:44:26,051 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-08 12:44:26,053 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-08 12:44:26,054 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-08 12:44:26,055 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-08 12:44:26,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-08 12:44:26,055 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #85#return; {2537#true} is VALID [2020-07-08 12:44:26,056 INFO L263 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret13 := main(); {2537#true} is VALID [2020-07-08 12:44:26,056 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-08 12:44:26,056 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-08 12:44:26,057 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-08 12:44:26,057 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-08 12:44:26,057 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-08 12:44:26,058 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-08 12:44:26,058 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-08 12:44:26,058 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-08 12:44:26,058 INFO L280 TraceCheckUtils]: 13: Hoare triple {2537#true} assume !(~i~0 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-08 12:44:26,059 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2537#true} {2537#true} #89#return; {2537#true} is VALID [2020-07-08 12:44:26,059 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-08 12:44:26,059 INFO L263 TraceCheckUtils]: 17: Hoare triple {2537#true} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {2537#true} is VALID [2020-07-08 12:44:26,059 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-08 12:44:26,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,060 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-08 12:44:26,060 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-08 12:44:26,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,060 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-08 12:44:26,060 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-08 12:44:26,061 INFO L280 TraceCheckUtils]: 25: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,061 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-08 12:44:26,062 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-08 12:44:26,063 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-08 12:44:26,064 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-08 12:44:26,065 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-08 12:44:26,065 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-08 12:44:26,065 INFO L280 TraceCheckUtils]: 32: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,065 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-08 12:44:26,066 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-08 12:44:26,066 INFO L280 TraceCheckUtils]: 35: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,067 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-08 12:44:26,067 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-08 12:44:26,067 INFO L280 TraceCheckUtils]: 38: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,068 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-08 12:44:26,069 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-08 12:44:26,070 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-08 12:44:26,071 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-08 12:44:26,073 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-08 12:44:26,074 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-08 12:44:26,075 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-08 12:44:26,076 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-08 12:44:26,076 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-08 12:44:26,077 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-08 12:44:26,077 INFO L280 TraceCheckUtils]: 49: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,077 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-08 12:44:26,077 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-08 12:44:26,077 INFO L280 TraceCheckUtils]: 52: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,078 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-08 12:44:26,078 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-08 12:44:26,078 INFO L280 TraceCheckUtils]: 55: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-08 12:44:26,079 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-08 12:44:26,079 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-08 12:44:26,081 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-08 12:44:26,082 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-08 12:44:26,083 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-08 12:44:26,083 INFO L280 TraceCheckUtils]: 61: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2020-07-08 12:44:26,087 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-08 12:44:26,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632261072] [2020-07-08 12:44:26,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:26,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 12:44:26,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444021588] [2020-07-08 12:44:26,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-08 12:44:26,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:26,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:44:26,134 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-08 12:44:26,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:44:26,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:44:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:44:26,135 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2020-07-08 12:44:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,336 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2020-07-08 12:44:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:44:27,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-08 12:44:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:44:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-08 12:44:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:44:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-08 12:44:27,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 73 transitions. [2020-07-08 12:44:27,447 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-08 12:44:27,451 INFO L225 Difference]: With dead ends: 74 [2020-07-08 12:44:27,452 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 12:44:27,453 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-08 12:44:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 12:44:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2020-07-08 12:44:27,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:27,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 56 states. [2020-07-08 12:44:27,505 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 56 states. [2020-07-08 12:44:27,505 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 56 states. [2020-07-08 12:44:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,510 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-08 12:44:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-08 12:44:27,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:27,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:27,511 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 70 states. [2020-07-08 12:44:27,511 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 70 states. [2020-07-08 12:44:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,515 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-08 12:44:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-08 12:44:27,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:27,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:27,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:27,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 12:44:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2020-07-08 12:44:27,519 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 62 [2020-07-08 12:44:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:27,520 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-07-08 12:44:27,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:44:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2020-07-08 12:44:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-08 12:44:27,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:27,521 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-08 12:44:27,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 12:44:27,522 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:27,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:27,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1679269433, now seen corresponding path program 1 times [2020-07-08 12:44:27,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:27,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948683379] [2020-07-08 12:44:27,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:27,540 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:27,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701009485] [2020-07-08 12:44:27,541 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-08 12:44:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:44:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,632 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:27,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {2922#true} call ULTIMATE.init(); {2922#true} is VALID [2020-07-08 12:44:27,806 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-08 12:44:27,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {2922#true} assume true; {2922#true} is VALID [2020-07-08 12:44:27,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2922#true} {2922#true} #85#return; {2922#true} is VALID [2020-07-08 12:44:27,807 INFO L263 TraceCheckUtils]: 4: Hoare triple {2922#true} call #t~ret13 := main(); {2922#true} is VALID [2020-07-08 12:44:27,807 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-08 12:44:27,807 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-08 12:44:27,807 INFO L263 TraceCheckUtils]: 7: Hoare triple {2922#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2922#true} is VALID [2020-07-08 12:44:27,808 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-08 12:44:27,809 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-08 12:44:27,810 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-08 12:44:27,810 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-08 12:44:27,811 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-08 12:44:27,812 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-08 12:44:27,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,813 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2969#(<= ~N~0 2)} {2922#true} #89#return; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,814 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-08 12:44:27,815 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-08 12:44:27,815 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-08 12:44:27,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,817 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-08 12:44:27,817 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-08 12:44:27,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,818 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-08 12:44:27,819 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-08 12:44:27,819 INFO L280 TraceCheckUtils]: 25: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,820 INFO L280 TraceCheckUtils]: 26: Hoare triple {2969#(<= ~N~0 2)} assume !(0 != ~cnt~0);#res := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,820 INFO L280 TraceCheckUtils]: 27: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,821 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2969#(<= ~N~0 2)} {2969#(<= ~N~0 2)} #91#return; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,822 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-08 12:44:27,823 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-08 12:44:27,823 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-08 12:44:27,824 INFO L280 TraceCheckUtils]: 32: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,824 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-08 12:44:27,825 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-08 12:44:27,825 INFO L280 TraceCheckUtils]: 35: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,826 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-08 12:44:27,826 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-08 12:44:27,827 INFO L280 TraceCheckUtils]: 38: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,827 INFO L280 TraceCheckUtils]: 39: Hoare triple {2969#(<= ~N~0 2)} assume !(0 != ~cnt~0);#res := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,828 INFO L280 TraceCheckUtils]: 40: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,829 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2969#(<= ~N~0 2)} {2969#(<= ~N~0 2)} #93#return; {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,829 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-08 12:44:27,830 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-08 12:44:27,831 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-08 12:44:27,831 INFO L280 TraceCheckUtils]: 45: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~2 < ~N~0 - 1); {2969#(<= ~N~0 2)} is VALID [2020-07-08 12:44:27,832 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-08 12:44:27,832 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-08 12:44:27,833 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-08 12:44:27,834 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-08 12:44:27,835 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-08 12:44:27,836 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-08 12:44:27,837 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-08 12:44:27,838 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-08 12:44:27,839 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-08 12:44:27,840 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-08 12:44:27,841 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-08 12:44:27,841 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-08 12:44:27,841 INFO L280 TraceCheckUtils]: 58: Hoare triple {2923#false} assume !(~i~1 < ~N~0); {2923#false} is VALID [2020-07-08 12:44:27,842 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-08 12:44:27,842 INFO L280 TraceCheckUtils]: 60: Hoare triple {2923#false} assume true; {2923#false} is VALID [2020-07-08 12:44:27,842 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2923#false} {2969#(<= ~N~0 2)} #95#return; {2923#false} is VALID [2020-07-08 12:44:27,843 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-08 12:44:27,843 INFO L280 TraceCheckUtils]: 63: Hoare triple {2923#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2923#false} is VALID [2020-07-08 12:44:27,843 INFO L280 TraceCheckUtils]: 64: Hoare triple {2923#false} assume !false; {2923#false} is VALID [2020-07-08 12:44:27,848 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-08 12:44:27,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948683379] [2020-07-08 12:44:27,849 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:27,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701009485] [2020-07-08 12:44:27,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:27,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 12:44:27,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467333145] [2020-07-08 12:44:27,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-08 12:44:27,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:27,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:44:27,928 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-08 12:44:27,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:44:27,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:44:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:44:27,930 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 9 states. [2020-07-08 12:44:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,455 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2020-07-08 12:44:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:44:28,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-08 12:44:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:44:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-08 12:44:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:44:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-08 12:44:28,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2020-07-08 12:44:28,610 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-08 12:44:28,613 INFO L225 Difference]: With dead ends: 120 [2020-07-08 12:44:28,613 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:44:28,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:44:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:44:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-08 12:44:28,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:28,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2020-07-08 12:44:28,691 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2020-07-08 12:44:28,691 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2020-07-08 12:44:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,696 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-08 12:44:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-07-08 12:44:28,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,697 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2020-07-08 12:44:28,697 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2020-07-08 12:44:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,699 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-08 12:44:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-07-08 12:44:28,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:28,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-08 12:44:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2020-07-08 12:44:28,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 65 [2020-07-08 12:44:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:28,704 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2020-07-08 12:44:28,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:44:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-08 12:44:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 12:44:28,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:28,706 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-08 12:44:28,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:28,921 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2040052581, now seen corresponding path program 2 times [2020-07-08 12:44:28,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:28,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684156907] [2020-07-08 12:44:28,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,039 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-08 12:44:29,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-08 12:44:29,040 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3493#true} {3493#true} #85#return; {3493#true} is VALID [2020-07-08 12:44:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,113 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-08 12:44:29,114 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-08 12:44:29,117 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-08 12:44:29,118 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-08 12:44:29,120 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-08 12:44:29,121 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-08 12:44:29,122 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-08 12:44:29,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {3508#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,123 INFO L280 TraceCheckUtils]: 8: Hoare triple {3508#(<= 3 ~N~0)} assume true; {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,124 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3508#(<= 3 ~N~0)} {3493#true} #89#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,136 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-08 12:44:29,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-08 12:44:29,137 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-08 12:44:29,137 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-08 12:44:29,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-08 12:44:29,137 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-08 12:44:29,138 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-08 12:44:29,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {3493#true} assume !(~i~1 < ~N~0); {3493#true} is VALID [2020-07-08 12:44:29,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} assume !(0 != ~cnt~0);#res := 0; {3493#true} is VALID [2020-07-08 12:44:29,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-08 12:44:29,140 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3493#true} {3508#(<= 3 ~N~0)} #91#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,151 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-08 12:44:29,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-08 12:44:29,152 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-08 12:44:29,152 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-08 12:44:29,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-08 12:44:29,152 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-08 12:44:29,153 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-08 12:44:29,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {3493#true} assume !(~i~1 < ~N~0); {3493#true} is VALID [2020-07-08 12:44:29,153 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} assume !(0 != ~cnt~0);#res := 0; {3493#true} is VALID [2020-07-08 12:44:29,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-08 12:44:29,155 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3493#true} {3508#(<= 3 ~N~0)} #93#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684156907] [2020-07-08 12:44:29,160 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-08 12:44:29,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084199417] [2020-07-08 12:44:29,160 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-08 12:44:29,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:44:29,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:29,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:44:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:29,480 INFO L263 TraceCheckUtils]: 0: Hoare triple {3493#true} call ULTIMATE.init(); {3493#true} is VALID [2020-07-08 12:44:29,480 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-08 12:44:29,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-08 12:44:29,480 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3493#true} {3493#true} #85#return; {3493#true} is VALID [2020-07-08 12:44:29,481 INFO L263 TraceCheckUtils]: 4: Hoare triple {3493#true} call #t~ret13 := main(); {3493#true} is VALID [2020-07-08 12:44:29,481 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-08 12:44:29,481 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-08 12:44:29,481 INFO L263 TraceCheckUtils]: 7: Hoare triple {3493#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3493#true} is VALID [2020-07-08 12:44:29,482 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-08 12:44:29,482 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-08 12:44:29,483 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-08 12:44:29,484 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-08 12:44:29,484 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-08 12:44:29,485 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-08 12:44:29,486 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-08 12:44:29,486 INFO L280 TraceCheckUtils]: 15: Hoare triple {3508#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {3508#(<= 3 ~N~0)} assume true; {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,487 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3508#(<= 3 ~N~0)} {3493#true} #89#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:29,488 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-08 12:44:29,488 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-08 12:44:29,493 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-08 12:44:29,494 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-08 12:44:29,495 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-08 12:44:29,496 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-08 12:44:29,497 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-08 12:44:29,498 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-08 12:44:29,498 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-08 12:44:29,499 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-08 12:44:29,499 INFO L280 TraceCheckUtils]: 28: Hoare triple {3494#false} assume !(0 != ~cnt~0);#res := 0; {3494#false} is VALID [2020-07-08 12:44:29,500 INFO L280 TraceCheckUtils]: 29: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-08 12:44:29,500 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3494#false} {3508#(<= 3 ~N~0)} #91#return; {3494#false} is VALID [2020-07-08 12:44:29,500 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-08 12:44:29,500 INFO L263 TraceCheckUtils]: 32: Hoare triple {3494#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {3494#false} is VALID [2020-07-08 12:44:29,500 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-08 12:44:29,500 INFO L280 TraceCheckUtils]: 34: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,501 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-08 12:44:29,501 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-08 12:44:29,501 INFO L280 TraceCheckUtils]: 37: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,501 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-08 12:44:29,501 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-08 12:44:29,502 INFO L280 TraceCheckUtils]: 40: Hoare triple {3494#false} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,502 INFO L280 TraceCheckUtils]: 41: Hoare triple {3494#false} assume !(0 != ~cnt~0);#res := 0; {3494#false} is VALID [2020-07-08 12:44:29,502 INFO L280 TraceCheckUtils]: 42: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-08 12:44:29,502 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3494#false} {3494#false} #93#return; {3494#false} is VALID [2020-07-08 12:44:29,502 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-08 12:44:29,503 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-08 12:44:29,503 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-08 12:44:29,503 INFO L280 TraceCheckUtils]: 47: Hoare triple {3494#false} assume !(~i~2 < ~N~0 - 1); {3494#false} is VALID [2020-07-08 12:44:29,503 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-08 12:44:29,503 INFO L263 TraceCheckUtils]: 49: Hoare triple {3494#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {3494#false} is VALID [2020-07-08 12:44:29,504 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-08 12:44:29,504 INFO L280 TraceCheckUtils]: 51: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,504 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-08 12:44:29,504 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-08 12:44:29,504 INFO L280 TraceCheckUtils]: 54: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,505 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-08 12:44:29,505 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-08 12:44:29,505 INFO L280 TraceCheckUtils]: 57: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,505 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-08 12:44:29,505 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-08 12:44:29,505 INFO L280 TraceCheckUtils]: 60: Hoare triple {3494#false} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-08 12:44:29,506 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-08 12:44:29,506 INFO L280 TraceCheckUtils]: 62: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-08 12:44:29,506 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3494#false} {3494#false} #95#return; {3494#false} is VALID [2020-07-08 12:44:29,506 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-08 12:44:29,506 INFO L280 TraceCheckUtils]: 65: Hoare triple {3494#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3494#false} is VALID [2020-07-08 12:44:29,507 INFO L280 TraceCheckUtils]: 66: Hoare triple {3494#false} assume !false; {3494#false} is VALID [2020-07-08 12:44:29,511 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-08 12:44:29,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:29,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 12:44:29,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381790843] [2020-07-08 12:44:29,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-08 12:44:29,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:29,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:44:29,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:29,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:44:29,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:44:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:44:29,584 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 9 states. [2020-07-08 12:44:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:29,991 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-08 12:44:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:44:29,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-08 12:44:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:44:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-08 12:44:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:44:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-08 12:44:29,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-08 12:44:30,101 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-08 12:44:30,104 INFO L225 Difference]: With dead ends: 99 [2020-07-08 12:44:30,104 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 12:44:30,105 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-08 12:44:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 12:44:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2020-07-08 12:44:30,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:30,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 60 states. [2020-07-08 12:44:30,169 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 60 states. [2020-07-08 12:44:30,169 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 60 states. [2020-07-08 12:44:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:30,174 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2020-07-08 12:44:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-07-08 12:44:30,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:30,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:30,175 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 63 states. [2020-07-08 12:44:30,175 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 63 states. [2020-07-08 12:44:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:30,178 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2020-07-08 12:44:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-07-08 12:44:30,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:30,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:30,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:30,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-08 12:44:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2020-07-08 12:44:30,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 67 [2020-07-08 12:44:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:30,183 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2020-07-08 12:44:30,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:44:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-07-08 12:44:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-08 12:44:30,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:30,184 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-08 12:44:30,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-08 12:44:30,385 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash -737365673, now seen corresponding path program 1 times [2020-07-08 12:44:30,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:30,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380694677] [2020-07-08 12:44:30,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:30,415 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:30,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729655215] [2020-07-08 12:44:30,415 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-08 12:44:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:30,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:44:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:30,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:30,666 INFO L263 TraceCheckUtils]: 0: Hoare triple {4104#true} call ULTIMATE.init(); {4104#true} is VALID [2020-07-08 12:44:30,666 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-08 12:44:30,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {4104#true} assume true; {4104#true} is VALID [2020-07-08 12:44:30,667 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4104#true} {4104#true} #85#return; {4104#true} is VALID [2020-07-08 12:44:30,667 INFO L263 TraceCheckUtils]: 4: Hoare triple {4104#true} call #t~ret13 := main(); {4104#true} is VALID [2020-07-08 12:44:30,667 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-08 12:44:30,667 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-08 12:44:30,667 INFO L263 TraceCheckUtils]: 7: Hoare triple {4104#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4104#true} is VALID [2020-07-08 12:44:30,669 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-08 12:44:30,669 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-08 12:44:30,673 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-08 12:44:30,673 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-08 12:44:30,675 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-08 12:44:30,677 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-08 12:44:30,678 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-08 12:44:30,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,680 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4151#(<= 3 ~N~0)} {4104#true} #89#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,680 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-08 12:44:30,681 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-08 12:44:30,682 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-08 12:44:30,683 INFO L280 TraceCheckUtils]: 21: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,684 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-08 12:44:30,685 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-08 12:44:30,685 INFO L280 TraceCheckUtils]: 24: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,686 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-08 12:44:30,687 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-08 12:44:30,688 INFO L280 TraceCheckUtils]: 27: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,688 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-08 12:44:30,689 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-08 12:44:30,691 INFO L280 TraceCheckUtils]: 30: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,691 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-08 12:44:30,692 INFO L280 TraceCheckUtils]: 32: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,693 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4151#(<= 3 ~N~0)} {4151#(<= 3 ~N~0)} #91#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,694 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-08 12:44:30,695 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-08 12:44:30,695 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-08 12:44:30,696 INFO L280 TraceCheckUtils]: 37: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,696 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-08 12:44:30,697 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-08 12:44:30,698 INFO L280 TraceCheckUtils]: 40: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,698 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-08 12:44:30,699 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-08 12:44:30,699 INFO L280 TraceCheckUtils]: 43: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,700 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-08 12:44:30,700 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-08 12:44:30,701 INFO L280 TraceCheckUtils]: 46: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,701 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-08 12:44:30,702 INFO L280 TraceCheckUtils]: 48: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,702 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4151#(<= 3 ~N~0)} {4151#(<= 3 ~N~0)} #93#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-08 12:44:30,704 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-08 12:44:30,705 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-08 12:44:30,707 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-08 12:44:30,708 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-08 12:44:30,708 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-08 12:44:30,708 INFO L263 TraceCheckUtils]: 55: Hoare triple {4105#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {4105#false} is VALID [2020-07-08 12:44:30,709 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-08 12:44:30,709 INFO L280 TraceCheckUtils]: 57: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-08 12:44:30,709 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-08 12:44:30,709 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-08 12:44:30,709 INFO L280 TraceCheckUtils]: 60: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-08 12:44:30,710 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-08 12:44:30,710 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-08 12:44:30,710 INFO L280 TraceCheckUtils]: 63: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-08 12:44:30,710 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-08 12:44:30,711 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-08 12:44:30,711 INFO L280 TraceCheckUtils]: 66: Hoare triple {4105#false} assume !(~i~1 < ~N~0); {4105#false} is VALID [2020-07-08 12:44:30,711 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-08 12:44:30,712 INFO L280 TraceCheckUtils]: 68: Hoare triple {4105#false} assume true; {4105#false} is VALID [2020-07-08 12:44:30,716 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4105#false} {4105#false} #95#return; {4105#false} is VALID [2020-07-08 12:44:30,717 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-08 12:44:30,717 INFO L280 TraceCheckUtils]: 71: Hoare triple {4105#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4105#false} is VALID [2020-07-08 12:44:30,717 INFO L280 TraceCheckUtils]: 72: Hoare triple {4105#false} assume !false; {4105#false} is VALID [2020-07-08 12:44:30,730 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-08 12:44:30,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380694677] [2020-07-08 12:44:30,731 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:30,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729655215] [2020-07-08 12:44:30,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:30,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:44:30,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595706958] [2020-07-08 12:44:30,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-08 12:44:30,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:30,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:44:30,819 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-08 12:44:30,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:44:30,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:44:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:44:30,820 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 8 states. [2020-07-08 12:44:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:31,209 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2020-07-08 12:44:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:44:31,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-08 12:44:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:44:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-08 12:44:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:44:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-08 12:44:31,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2020-07-08 12:44:31,298 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-08 12:44:31,301 INFO L225 Difference]: With dead ends: 94 [2020-07-08 12:44:31,301 INFO L226 Difference]: Without dead ends: 66 [2020-07-08 12:44:31,302 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-08 12:44:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-08 12:44:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-08 12:44:31,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:31,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-08 12:44:31,395 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-08 12:44:31,395 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-08 12:44:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:31,399 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-08 12:44:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-08 12:44:31,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:31,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:31,403 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-08 12:44:31,403 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-08 12:44:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:31,407 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-08 12:44:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-08 12:44:31,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:31,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:31,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:31,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-08 12:44:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2020-07-08 12:44:31,411 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 73 [2020-07-08 12:44:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:31,414 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2020-07-08 12:44:31,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:44:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-07-08 12:44:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-08 12:44:31,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:31,417 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-08 12:44:31,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-08 12:44:31,631 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:31,631 INFO L82 PathProgramCache]: Analyzing trace with hash 132738585, now seen corresponding path program 2 times [2020-07-08 12:44:31,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:31,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733326653] [2020-07-08 12:44:31,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:31,645 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:31,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387816661] [2020-07-08 12:44:31,645 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-08 12:44:31,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:44:31,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-08 12:44:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:31,860 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:44:31,861 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:44:32,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:32,164 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:32,165 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:44:32,166 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L7-4 has no Hoare annotation [2020-07-08 12:44:32,167 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-08 12:44:32,168 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-08 12:44:32,169 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:44:32,170 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:44:32,170 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-08 12:44:32,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:44:32 BoogieIcfgContainer [2020-07-08 12:44:32,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:44:32,176 INFO L168 Benchmark]: Toolchain (without parser) took 17528.52 ms. Allocated memory was 137.4 MB in the beginning and 363.3 MB in the end (delta: 226.0 MB). Free memory was 101.6 MB in the beginning and 311.8 MB in the end (delta: -210.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:32,177 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:44:32,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.23 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 179.9 MB in the end (delta: -78.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:32,178 INFO L168 Benchmark]: Boogie Preprocessor took 50.08 ms. Allocated memory is still 200.8 MB. Free memory was 179.9 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:32,178 INFO L168 Benchmark]: RCFGBuilder took 820.68 ms. Allocated memory is still 200.8 MB. Free memory was 177.5 MB in the beginning and 147.1 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:32,179 INFO L168 Benchmark]: TraceAbstraction took 16210.60 ms. Allocated memory was 200.8 MB in the beginning and 363.3 MB in the end (delta: 162.5 MB). Free memory was 146.4 MB in the beginning and 311.8 MB in the end (delta: -165.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:44:32,181 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.80 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 441.23 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 179.9 MB in the end (delta: -78.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.08 ms. Allocated memory is still 200.8 MB. Free memory was 179.9 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.68 ms. Allocated memory is still 200.8 MB. Free memory was 177.5 MB in the beginning and 147.1 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16210.60 ms. Allocated memory was 200.8 MB in the beginning and 363.3 MB in the end (delta: 162.5 MB). Free memory was 146.4 MB in the beginning and 311.8 MB in the end (delta: -165.4 MB). There was no memory consumed. 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=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={2:0}, x={2:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=0, 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=0, temp=0, 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=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={2:0}, x={2:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=0, ret=0, temp=0, 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=0, ret2=0, temp=2, 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=2, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2, cnt=1, i=3, N=3, ret=2, x={2:0}, x={2:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=2, ret=0, ret2=0, temp=2, x={2:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=0, ret2=0, ret5=2, temp=2, x={2:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=0, ret2=0, ret5=2, temp=2, 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.0s, OverallIterations: 12, TraceHistogramMax: 9, AutomataDifference: 8.2s, 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, 1.7s 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.5s SatisfiabilityAnalysisTime, 3.0s 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...