/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-267fbe0 [2020-07-17 22:48:41,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:41,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:41,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:41,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:41,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:41,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:41,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:41,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:41,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:41,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:41,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:41,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:41,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:41,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:41,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:41,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:41,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:41,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:41,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:41,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:41,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:41,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:41,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:41,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:41,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:41,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:41,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:41,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:41,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:41,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:41,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:41,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:41,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:41,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:41,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:41,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:41,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:41,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:41,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:41,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:41,837 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-17 22:48:41,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:41,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:41,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:41,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:41,871 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:41,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:41,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:41,873 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:41,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:41,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:41,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:41,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:41,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:41,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:41,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:41,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:41,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:41,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:41,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:41,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:41,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:41,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:41,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:41,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:42,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:42,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:42,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:42,257 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:42,257 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:42,258 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum.i [2020-07-17 22:48:42,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472780d7a/2088656b730d492ca8211d14c1cb354f/FLAG614dba16e [2020-07-17 22:48:42,886 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:42,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i [2020-07-17 22:48:42,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472780d7a/2088656b730d492ca8211d14c1cb354f/FLAG614dba16e [2020-07-17 22:48:43,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472780d7a/2088656b730d492ca8211d14c1cb354f [2020-07-17 22:48:43,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:43,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:43,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:43,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:43,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:43,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7401d1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43, skipping insertion in model container [2020-07-17 22:48:43,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:43,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:43,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:43,502 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:43,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:43,551 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:43,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43 WrapperNode [2020-07-17 22:48:43,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:43,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:43,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:43,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:43,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:43,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:43,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:43,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:43,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (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-17 22:48:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2020-07-17 22:48:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2020-07-17 22:48:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:48:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:44,273 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:44,274 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:44,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:44 BoogieIcfgContainer [2020-07-17 22:48:44,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:44,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:44,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:44,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:44,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:43" (1/3) ... [2020-07-17 22:48:44,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5ed3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:44, skipping insertion in model container [2020-07-17 22:48:44,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (2/3) ... [2020-07-17 22:48:44,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5ed3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:44, skipping insertion in model container [2020-07-17 22:48:44,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:44" (3/3) ... [2020-07-17 22:48:44,289 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum.i [2020-07-17 22:48:44,301 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:44,310 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:44,325 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:44,353 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:44,353 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:44,354 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:44,354 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:44,354 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:44,354 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:44,355 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:44,355 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-17 22:48:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:48:44,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:44,388 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-17 22:48:44,388 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:44,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1377249276, now seen corresponding path program 1 times [2020-07-17 22:48:44,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:44,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168043777] [2020-07-17 22:48:44,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:44,680 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-17 22:48:44,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-17 22:48:44,682 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #85#return; {42#true} is VALID [2020-07-17 22:48:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:44,710 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-17 22:48:44,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-17 22:48:44,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-17 22:48:44,714 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #89#return; {43#false} is VALID [2020-07-17 22:48:44,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168043777] [2020-07-17 22:48:44,722 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-17 22:48:44,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969299191] [2020-07-17 22:48:44,722 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-17 22:48:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:44,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-17 22:48:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:44,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:44,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2020-07-17 22:48:44,931 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-17 22:48:44,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-17 22:48:44,932 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #85#return; {42#true} is VALID [2020-07-17 22:48:44,933 INFO L263 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2020-07-17 22:48:44,933 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-17 22:48:44,934 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-17 22:48:44,934 INFO L263 TraceCheckUtils]: 7: Hoare triple {42#true} call init_nondet(~#x~0.base, ~#x~0.offset); {42#true} is VALID [2020-07-17 22:48:44,935 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-17 22:48:44,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-17 22:48:44,937 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-17 22:48:44,937 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {43#false} {42#true} #89#return; {43#false} is VALID [2020-07-17 22:48:44,937 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-17 22:48:44,938 INFO L263 TraceCheckUtils]: 13: Hoare triple {43#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-17 22:48:44,938 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-17 22:48:44,939 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-17 22:48:44,939 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-17 22:48:44,940 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-17 22:48:44,940 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {43#false} {43#false} #91#return; {43#false} is VALID [2020-07-17 22:48:44,941 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-17 22:48:44,941 INFO L263 TraceCheckUtils]: 20: Hoare triple {43#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-17 22:48:44,941 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-17 22:48:44,942 INFO L280 TraceCheckUtils]: 22: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-17 22:48:44,942 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-17 22:48:44,943 INFO L280 TraceCheckUtils]: 24: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-17 22:48:44,943 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {43#false} {43#false} #93#return; {43#false} is VALID [2020-07-17 22:48:44,944 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-17 22:48:44,944 INFO L280 TraceCheckUtils]: 27: Hoare triple {43#false} assume !(~i~2 < ~N~0 - 1); {43#false} is VALID [2020-07-17 22:48:44,945 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-17 22:48:44,945 INFO L263 TraceCheckUtils]: 29: Hoare triple {43#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {43#false} is VALID [2020-07-17 22:48:44,945 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-17 22:48:44,946 INFO L280 TraceCheckUtils]: 31: Hoare triple {43#false} assume !(~i~1 < ~N~0); {43#false} is VALID [2020-07-17 22:48:44,946 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-17 22:48:44,947 INFO L280 TraceCheckUtils]: 33: Hoare triple {43#false} assume true; {43#false} is VALID [2020-07-17 22:48:44,947 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {43#false} {43#false} #95#return; {43#false} is VALID [2020-07-17 22:48:44,947 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-17 22:48:44,948 INFO L280 TraceCheckUtils]: 36: Hoare triple {43#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {43#false} is VALID [2020-07-17 22:48:44,948 INFO L280 TraceCheckUtils]: 37: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-17 22:48:44,955 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-17 22:48:44,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:44,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:48:44,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436444214] [2020-07-17 22:48:44,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2020-07-17 22:48:44,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:44,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:48:45,040 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-17 22:48:45,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:48:45,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:48:45,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:48:45,056 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2020-07-17 22:48:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:45,165 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2020-07-17 22:48:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:48:45,166 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2020-07-17 22:48:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:48:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2020-07-17 22:48:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:48:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2020-07-17 22:48:45,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2020-07-17 22:48:45,342 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-17 22:48:45,359 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:48:45,359 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:48:45,364 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-17 22:48:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:48:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-17 22:48:45,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:45,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:45,420 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:45,420 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:45,427 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-17 22:48:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-17 22:48:45,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:45,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:45,429 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:45,429 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:45,436 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-17 22:48:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-17 22:48:45,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:45,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:45,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:45,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:48:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-07-17 22:48:45,457 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2020-07-17 22:48:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:45,457 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-17 22:48:45,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:48:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-17 22:48:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:48:45,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:45,462 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-17 22:48:45,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-17 22:48:45,679 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1240892162, now seen corresponding path program 1 times [2020-07-17 22:48:45,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:45,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516298059] [2020-07-17 22:48:45,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:45,732 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:45,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217409518] [2020-07-17 22:48:45,733 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-17 22:48:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:45,860 INFO L263 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2020-07-17 22:48:45,860 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-17 22:48:45,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-17 22:48:45,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #85#return; {379#true} is VALID [2020-07-17 22:48:45,861 INFO L263 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret13 := main(); {379#true} is VALID [2020-07-17 22:48:45,861 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-17 22:48:45,862 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-17 22:48:45,862 INFO L263 TraceCheckUtils]: 7: Hoare triple {379#true} call init_nondet(~#x~0.base, ~#x~0.offset); {379#true} is VALID [2020-07-17 22:48:45,862 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-17 22:48:45,863 INFO L280 TraceCheckUtils]: 9: Hoare triple {379#true} assume !(~i~0 < ~N~0); {379#true} is VALID [2020-07-17 22:48:45,863 INFO L280 TraceCheckUtils]: 10: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-17 22:48:45,863 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {379#true} {379#true} #89#return; {379#true} is VALID [2020-07-17 22:48:45,864 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-17 22:48:45,864 INFO L263 TraceCheckUtils]: 13: Hoare triple {379#true} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {379#true} is VALID [2020-07-17 22:48:45,865 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-17 22:48:45,866 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-17 22:48:45,867 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-17 22:48:45,868 INFO L280 TraceCheckUtils]: 17: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-17 22:48:45,868 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {380#false} {379#true} #91#return; {380#false} is VALID [2020-07-17 22:48:45,869 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-17 22:48:45,869 INFO L263 TraceCheckUtils]: 20: Hoare triple {380#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {380#false} is VALID [2020-07-17 22:48:45,869 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-17 22:48:45,870 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#false} assume !(~i~1 < ~N~0); {380#false} is VALID [2020-07-17 22:48:45,870 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-17 22:48:45,870 INFO L280 TraceCheckUtils]: 24: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-17 22:48:45,871 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {380#false} {380#false} #93#return; {380#false} is VALID [2020-07-17 22:48:45,871 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-17 22:48:45,871 INFO L280 TraceCheckUtils]: 27: Hoare triple {380#false} assume !(~i~2 < ~N~0 - 1); {380#false} is VALID [2020-07-17 22:48:45,872 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-17 22:48:45,872 INFO L263 TraceCheckUtils]: 29: Hoare triple {380#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {380#false} is VALID [2020-07-17 22:48:45,872 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-17 22:48:45,873 INFO L280 TraceCheckUtils]: 31: Hoare triple {380#false} assume !(~i~1 < ~N~0); {380#false} is VALID [2020-07-17 22:48:45,873 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-17 22:48:45,873 INFO L280 TraceCheckUtils]: 33: Hoare triple {380#false} assume true; {380#false} is VALID [2020-07-17 22:48:45,874 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {380#false} {380#false} #95#return; {380#false} is VALID [2020-07-17 22:48:45,874 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-17 22:48:45,875 INFO L280 TraceCheckUtils]: 36: Hoare triple {380#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {380#false} is VALID [2020-07-17 22:48:45,875 INFO L280 TraceCheckUtils]: 37: Hoare triple {380#false} assume !false; {380#false} is VALID [2020-07-17 22:48:45,877 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-17 22:48:45,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516298059] [2020-07-17 22:48:45,878 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:45,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217409518] [2020-07-17 22:48:45,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:45,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:45,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102387640] [2020-07-17 22:48:45,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-17 22:48:45,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:45,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:45,926 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-17 22:48:45,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:45,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:45,928 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2020-07-17 22:48:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,066 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2020-07-17 22:48:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:46,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-17 22:48:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2020-07-17 22:48:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2020-07-17 22:48:46,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2020-07-17 22:48:46,185 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-17 22:48:46,188 INFO L225 Difference]: With dead ends: 57 [2020-07-17 22:48:46,188 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:48:46,189 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-17 22:48:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:48:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-17 22:48:46,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:46,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-17 22:48:46,209 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-17 22:48:46,209 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-17 22:48:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,214 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-17 22:48:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-17 22:48:46,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,216 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-17 22:48:46,217 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-17 22:48:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,222 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-17 22:48:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-17 22:48:46,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:46,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:48:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-07-17 22:48:46,229 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2020-07-17 22:48:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:46,230 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-07-17 22:48:46,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-17 22:48:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:48:46,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:46,232 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-17 22:48:46,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:46,447 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1742767491, now seen corresponding path program 1 times [2020-07-17 22:48:46,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:46,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196358349] [2020-07-17 22:48:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,576 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-17 22:48:46,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,577 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {700#true} {700#true} #85#return; {700#true} is VALID [2020-07-17 22:48:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,629 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-17 22:48:46,630 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-17 22:48:46,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {728#(<= ~N~0 0)} assume true; {728#(<= ~N~0 0)} is VALID [2020-07-17 22:48:46,633 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {728#(<= ~N~0 0)} {705#(<= 2 ~N~0)} #89#return; {701#false} is VALID [2020-07-17 22:48:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,643 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-17 22:48:46,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-17 22:48:46,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-17 22:48:46,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,645 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #91#return; {701#false} is VALID [2020-07-17 22:48:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,654 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-17 22:48:46,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-17 22:48:46,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-17 22:48:46,656 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,656 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #93#return; {701#false} is VALID [2020-07-17 22:48:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,667 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-17 22:48:46,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-17 22:48:46,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-17 22:48:46,669 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,669 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {700#true} {701#false} #95#return; {701#false} is VALID [2020-07-17 22:48:46,671 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-17 22:48:46,672 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-17 22:48:46,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,672 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {700#true} {700#true} #85#return; {700#true} is VALID [2020-07-17 22:48:46,673 INFO L263 TraceCheckUtils]: 4: Hoare triple {700#true} call #t~ret13 := main(); {700#true} is VALID [2020-07-17 22:48:46,673 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-17 22:48:46,675 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-17 22:48:46,677 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-17 22:48:46,678 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-17 22:48:46,680 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-17 22:48:46,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {728#(<= ~N~0 0)} assume true; {728#(<= ~N~0 0)} is VALID [2020-07-17 22:48:46,682 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {728#(<= ~N~0 0)} {705#(<= 2 ~N~0)} #89#return; {701#false} is VALID [2020-07-17 22:48:46,682 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-17 22:48:46,683 INFO L263 TraceCheckUtils]: 13: Hoare triple {701#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-17 22:48:46,683 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-17 22:48:46,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-17 22:48:46,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-17 22:48:46,684 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,685 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {700#true} {701#false} #91#return; {701#false} is VALID [2020-07-17 22:48:46,685 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-17 22:48:46,686 INFO L263 TraceCheckUtils]: 20: Hoare triple {701#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-17 22:48:46,686 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-17 22:48:46,686 INFO L280 TraceCheckUtils]: 22: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-17 22:48:46,687 INFO L280 TraceCheckUtils]: 23: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-17 22:48:46,687 INFO L280 TraceCheckUtils]: 24: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,687 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {700#true} {701#false} #93#return; {701#false} is VALID [2020-07-17 22:48:46,688 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-17 22:48:46,688 INFO L280 TraceCheckUtils]: 27: Hoare triple {701#false} assume !(~i~2 < ~N~0 - 1); {701#false} is VALID [2020-07-17 22:48:46,688 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-17 22:48:46,689 INFO L263 TraceCheckUtils]: 29: Hoare triple {701#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {700#true} is VALID [2020-07-17 22:48:46,689 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-17 22:48:46,689 INFO L280 TraceCheckUtils]: 31: Hoare triple {700#true} assume !(~i~1 < ~N~0); {700#true} is VALID [2020-07-17 22:48:46,689 INFO L280 TraceCheckUtils]: 32: Hoare triple {700#true} assume !(0 != ~cnt~0);#res := 0; {700#true} is VALID [2020-07-17 22:48:46,690 INFO L280 TraceCheckUtils]: 33: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:48:46,690 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {700#true} {701#false} #95#return; {701#false} is VALID [2020-07-17 22:48:46,690 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-17 22:48:46,691 INFO L280 TraceCheckUtils]: 36: Hoare triple {701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {701#false} is VALID [2020-07-17 22:48:46,691 INFO L280 TraceCheckUtils]: 37: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-17 22:48:46,708 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-17 22:48:46,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196358349] [2020-07-17 22:48:46,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:46,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:48:46,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999732660] [2020-07-17 22:48:46,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-17 22:48:46,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:46,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:48:46,769 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-17 22:48:46,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:48:46,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:48:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:48:46,771 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 7 states. [2020-07-17 22:48:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,672 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-07-17 22:48:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:48:47,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-17 22:48:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:48:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-17 22:48:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:48:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-17 22:48:47,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2020-07-17 22:48:47,789 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-17 22:48:47,791 INFO L225 Difference]: With dead ends: 65 [2020-07-17 22:48:47,792 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:48:47,793 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-17 22:48:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:48:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-17 22:48:47,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:47,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-17 22:48:47,837 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-17 22:48:47,837 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-17 22:48:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,843 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-17 22:48:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-17 22:48:47,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,847 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-17 22:48:47,847 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-17 22:48:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,852 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-17 22:48:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-17 22:48:47,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:47,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:48:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-17 22:48:47,860 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 38 [2020-07-17 22:48:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:47,861 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-17 22:48:47,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:48:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-17 22:48:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:48:47,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:47,871 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-17 22:48:47,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:48:47,872 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash 558201179, now seen corresponding path program 1 times [2020-07-17 22:48:47,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:47,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583993038] [2020-07-17 22:48:47,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,003 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-17 22:48:48,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-17 22:48:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,051 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-17 22:48:48,052 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-17 22:48:48,053 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-17 22:48:48,053 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-17 22:48:48,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#(<= ~N~0 1)} assume true; {997#(<= ~N~0 1)} is VALID [2020-07-17 22:48:48,055 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {997#(<= ~N~0 1)} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-17 22:48:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,063 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-17 22:48:48,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-17 22:48:48,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-17 22:48:48,064 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,064 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #91#return; {967#false} is VALID [2020-07-17 22:48:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,076 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-17 22:48:48,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-17 22:48:48,076 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-17 22:48:48,077 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,077 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #93#return; {967#false} is VALID [2020-07-17 22:48:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,085 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-17 22:48:48,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-17 22:48:48,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-17 22:48:48,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,087 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {966#true} {967#false} #95#return; {967#false} is VALID [2020-07-17 22:48:48,088 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-17 22:48:48,088 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-17 22:48:48,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,089 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-17 22:48:48,089 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret13 := main(); {966#true} is VALID [2020-07-17 22:48:48,089 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-17 22:48:48,090 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-17 22:48:48,092 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-17 22:48:48,093 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-17 22:48:48,093 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-17 22:48:48,094 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-17 22:48:48,095 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-17 22:48:48,096 INFO L280 TraceCheckUtils]: 12: Hoare triple {997#(<= ~N~0 1)} assume true; {997#(<= ~N~0 1)} is VALID [2020-07-17 22:48:48,097 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {997#(<= ~N~0 1)} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-17 22:48:48,098 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-17 22:48:48,098 INFO L263 TraceCheckUtils]: 15: Hoare triple {967#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-17 22:48:48,098 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-17 22:48:48,098 INFO L280 TraceCheckUtils]: 17: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-17 22:48:48,099 INFO L280 TraceCheckUtils]: 18: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-17 22:48:48,099 INFO L280 TraceCheckUtils]: 19: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,099 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {966#true} {967#false} #91#return; {967#false} is VALID [2020-07-17 22:48:48,099 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-17 22:48:48,100 INFO L263 TraceCheckUtils]: 22: Hoare triple {967#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-17 22:48:48,100 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-17 22:48:48,100 INFO L280 TraceCheckUtils]: 24: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-17 22:48:48,100 INFO L280 TraceCheckUtils]: 25: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-17 22:48:48,101 INFO L280 TraceCheckUtils]: 26: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,101 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {966#true} {967#false} #93#return; {967#false} is VALID [2020-07-17 22:48:48,101 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-17 22:48:48,101 INFO L280 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(~i~2 < ~N~0 - 1); {967#false} is VALID [2020-07-17 22:48:48,102 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-17 22:48:48,102 INFO L263 TraceCheckUtils]: 31: Hoare triple {967#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {966#true} is VALID [2020-07-17 22:48:48,102 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-17 22:48:48,102 INFO L280 TraceCheckUtils]: 33: Hoare triple {966#true} assume !(~i~1 < ~N~0); {966#true} is VALID [2020-07-17 22:48:48,103 INFO L280 TraceCheckUtils]: 34: Hoare triple {966#true} assume !(0 != ~cnt~0);#res := 0; {966#true} is VALID [2020-07-17 22:48:48,103 INFO L280 TraceCheckUtils]: 35: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,103 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {966#true} {967#false} #95#return; {967#false} is VALID [2020-07-17 22:48:48,103 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-17 22:48:48,103 INFO L280 TraceCheckUtils]: 38: Hoare triple {967#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {967#false} is VALID [2020-07-17 22:48:48,104 INFO L280 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-17 22:48:48,106 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-17 22:48:48,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583993038] [2020-07-17 22:48:48,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996034854] [2020-07-17 22:48:48,107 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-17 22:48:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:48,325 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-17 22:48:48,326 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-17 22:48:48,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:48:48,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #85#return; {966#true} is VALID [2020-07-17 22:48:48,327 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret13 := main(); {966#true} is VALID [2020-07-17 22:48:48,327 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-17 22:48:48,329 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-17 22:48:48,330 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-17 22:48:48,330 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-17 22:48:48,331 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-17 22:48:48,332 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-17 22:48:48,333 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-17 22:48:48,334 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-17 22:48:48,334 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {967#false} {971#(<= 2 ~N~0)} #89#return; {967#false} is VALID [2020-07-17 22:48:48,334 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-17 22:48:48,335 INFO L263 TraceCheckUtils]: 15: Hoare triple {967#false} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-17 22:48:48,335 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-17 22:48:48,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-17 22:48:48,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-17 22:48:48,336 INFO L280 TraceCheckUtils]: 19: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-17 22:48:48,336 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {967#false} {967#false} #91#return; {967#false} is VALID [2020-07-17 22:48:48,336 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-17 22:48:48,337 INFO L263 TraceCheckUtils]: 22: Hoare triple {967#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-17 22:48:48,337 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-17 22:48:48,337 INFO L280 TraceCheckUtils]: 24: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-17 22:48:48,337 INFO L280 TraceCheckUtils]: 25: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-17 22:48:48,337 INFO L280 TraceCheckUtils]: 26: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-17 22:48:48,338 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {967#false} {967#false} #93#return; {967#false} is VALID [2020-07-17 22:48:48,338 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-17 22:48:48,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(~i~2 < ~N~0 - 1); {967#false} is VALID [2020-07-17 22:48:48,338 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-17 22:48:48,339 INFO L263 TraceCheckUtils]: 31: Hoare triple {967#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {967#false} is VALID [2020-07-17 22:48:48,339 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-17 22:48:48,339 INFO L280 TraceCheckUtils]: 33: Hoare triple {967#false} assume !(~i~1 < ~N~0); {967#false} is VALID [2020-07-17 22:48:48,339 INFO L280 TraceCheckUtils]: 34: Hoare triple {967#false} assume !(0 != ~cnt~0);#res := 0; {967#false} is VALID [2020-07-17 22:48:48,340 INFO L280 TraceCheckUtils]: 35: Hoare triple {967#false} assume true; {967#false} is VALID [2020-07-17 22:48:48,340 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {967#false} {967#false} #95#return; {967#false} is VALID [2020-07-17 22:48:48,340 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-17 22:48:48,340 INFO L280 TraceCheckUtils]: 38: Hoare triple {967#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {967#false} is VALID [2020-07-17 22:48:48,341 INFO L280 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-17 22:48:48,343 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-17 22:48:48,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:48,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2020-07-17 22:48:48,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380898912] [2020-07-17 22:48:48,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-17 22:48:48,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:48,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:48:48,402 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-17 22:48:48,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:48:48,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:48:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:48:48,404 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-07-17 22:48:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,350 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2020-07-17 22:48:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:48:49,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-17 22:48:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:48:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-07-17 22:48:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:48:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-07-17 22:48:49,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2020-07-17 22:48:49,467 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-17 22:48:49,469 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:48:49,469 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:48:49,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:48:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:48:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-07-17 22:48:49,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:49,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2020-07-17 22:48:49,525 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2020-07-17 22:48:49,525 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2020-07-17 22:48:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,533 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-17 22:48:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-17 22:48:49,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:49,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:49,534 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2020-07-17 22:48:49,534 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2020-07-17 22:48:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,539 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-17 22:48:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-17 22:48:49,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:49,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:49,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:49,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:48:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-17 22:48:49,548 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 40 [2020-07-17 22:48:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:49,549 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-17 22:48:49,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:48:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:48:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:48:49,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:49,550 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-17 22:48:49,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:49,767 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash -119064391, now seen corresponding path program 2 times [2020-07-17 22:48:49,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:49,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778965758] [2020-07-17 22:48:49,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,839 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-17 22:48:49,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,839 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-17 22:48:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,858 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-17 22:48:49,859 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-17 22:48:49,859 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-17 22:48:49,860 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-17 22:48:49,860 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-17 22:48:49,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} assume !(~i~0 < ~N~0); {1366#true} is VALID [2020-07-17 22:48:49,860 INFO L280 TraceCheckUtils]: 6: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,861 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1366#true} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,891 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-17 22:48:49,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {1397#(<= rangesum_~i~1 0)} assume !(~i~1 < ~N~0); {1398#(<= ~N~0 0)} is VALID [2020-07-17 22:48:49,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {1398#(<= ~N~0 0)} assume !(0 != ~cnt~0);#res := 0; {1398#(<= ~N~0 0)} is VALID [2020-07-17 22:48:49,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {1398#(<= ~N~0 0)} assume true; {1398#(<= ~N~0 0)} is VALID [2020-07-17 22:48:49,895 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1398#(<= ~N~0 0)} {1371#(<= 2 ~N~0)} #91#return; {1367#false} is VALID [2020-07-17 22:48:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,901 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-17 22:48:49,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-17 22:48:49,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-17 22:48:49,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,903 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1366#true} {1367#false} #93#return; {1367#false} is VALID [2020-07-17 22:48:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,909 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-17 22:48:49,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-17 22:48:49,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-17 22:48:49,910 INFO L280 TraceCheckUtils]: 3: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,910 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1366#true} {1367#false} #95#return; {1367#false} is VALID [2020-07-17 22:48:49,911 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-17 22:48:49,912 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-17 22:48:49,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,913 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-17 22:48:49,913 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2020-07-17 22:48:49,913 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-17 22:48:49,915 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-17 22:48:49,916 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-17 22:48:49,916 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-17 22:48:49,917 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-17 22:48:49,917 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-17 22:48:49,917 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-17 22:48:49,917 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-17 22:48:49,918 INFO L280 TraceCheckUtils]: 13: Hoare triple {1366#true} assume !(~i~0 < ~N~0); {1366#true} is VALID [2020-07-17 22:48:49,918 INFO L280 TraceCheckUtils]: 14: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,919 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1366#true} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:49,920 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-17 22:48:49,920 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-17 22:48:49,921 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-17 22:48:49,922 INFO L280 TraceCheckUtils]: 19: Hoare triple {1397#(<= rangesum_~i~1 0)} assume !(~i~1 < ~N~0); {1398#(<= ~N~0 0)} is VALID [2020-07-17 22:48:49,923 INFO L280 TraceCheckUtils]: 20: Hoare triple {1398#(<= ~N~0 0)} assume !(0 != ~cnt~0);#res := 0; {1398#(<= ~N~0 0)} is VALID [2020-07-17 22:48:49,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {1398#(<= ~N~0 0)} assume true; {1398#(<= ~N~0 0)} is VALID [2020-07-17 22:48:49,925 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1398#(<= ~N~0 0)} {1371#(<= 2 ~N~0)} #91#return; {1367#false} is VALID [2020-07-17 22:48:49,926 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-17 22:48:49,926 INFO L263 TraceCheckUtils]: 24: Hoare triple {1367#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-17 22:48:49,926 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-17 22:48:49,927 INFO L280 TraceCheckUtils]: 26: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-17 22:48:49,927 INFO L280 TraceCheckUtils]: 27: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-17 22:48:49,927 INFO L280 TraceCheckUtils]: 28: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,927 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1366#true} {1367#false} #93#return; {1367#false} is VALID [2020-07-17 22:48:49,928 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-17 22:48:49,928 INFO L280 TraceCheckUtils]: 31: Hoare triple {1367#false} assume !(~i~2 < ~N~0 - 1); {1367#false} is VALID [2020-07-17 22:48:49,928 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-17 22:48:49,928 INFO L263 TraceCheckUtils]: 33: Hoare triple {1367#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1366#true} is VALID [2020-07-17 22:48:49,929 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-17 22:48:49,929 INFO L280 TraceCheckUtils]: 35: Hoare triple {1366#true} assume !(~i~1 < ~N~0); {1366#true} is VALID [2020-07-17 22:48:49,929 INFO L280 TraceCheckUtils]: 36: Hoare triple {1366#true} assume !(0 != ~cnt~0);#res := 0; {1366#true} is VALID [2020-07-17 22:48:49,929 INFO L280 TraceCheckUtils]: 37: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:49,930 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1366#true} {1367#false} #95#return; {1367#false} is VALID [2020-07-17 22:48:49,930 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-17 22:48:49,930 INFO L280 TraceCheckUtils]: 40: Hoare triple {1367#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1367#false} is VALID [2020-07-17 22:48:49,930 INFO L280 TraceCheckUtils]: 41: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-17 22:48:49,932 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-17 22:48:49,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778965758] [2020-07-17 22:48:49,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183761388] [2020-07-17 22:48:49,933 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-17 22:48:49,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-17 22:48:49,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:49,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:50,065 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2020-07-17 22:48:50,065 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-17 22:48:50,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:48:50,066 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #85#return; {1366#true} is VALID [2020-07-17 22:48:50,066 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2020-07-17 22:48:50,066 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-17 22:48:50,067 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-17 22:48:50,068 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-17 22:48:50,069 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-17 22:48:50,069 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-17 22:48:50,070 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-17 22:48:50,070 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-17 22:48:50,070 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-17 22:48:50,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,072 INFO L280 TraceCheckUtils]: 14: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,073 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #89#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,074 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-17 22:48:50,074 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-17 22:48:50,075 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-17 22:48:50,075 INFO L280 TraceCheckUtils]: 19: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~1 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,076 INFO L280 TraceCheckUtils]: 20: Hoare triple {1371#(<= 2 ~N~0)} assume !(0 != ~cnt~0);#res := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,077 INFO L280 TraceCheckUtils]: 21: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,078 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #91#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,079 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-17 22:48:50,081 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-17 22:48:50,081 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-17 22:48:50,082 INFO L280 TraceCheckUtils]: 26: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~1 < ~N~0); {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,083 INFO L280 TraceCheckUtils]: 27: Hoare triple {1371#(<= 2 ~N~0)} assume !(0 != ~cnt~0);#res := 0; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,084 INFO L280 TraceCheckUtils]: 28: Hoare triple {1371#(<= 2 ~N~0)} assume true; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,086 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1371#(<= 2 ~N~0)} {1371#(<= 2 ~N~0)} #93#return; {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,087 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-17 22:48:50,092 INFO L280 TraceCheckUtils]: 31: Hoare triple {1371#(<= 2 ~N~0)} assume !(~i~2 < ~N~0 - 1); {1371#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,093 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-17 22:48:50,095 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-17 22:48:50,096 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-17 22:48:50,097 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-17 22:48:50,097 INFO L280 TraceCheckUtils]: 36: Hoare triple {1367#false} assume !(0 != ~cnt~0);#res := 0; {1367#false} is VALID [2020-07-17 22:48:50,097 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} assume true; {1367#false} is VALID [2020-07-17 22:48:50,097 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1367#false} {1371#(<= 2 ~N~0)} #95#return; {1367#false} is VALID [2020-07-17 22:48:50,098 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-17 22:48:50,098 INFO L280 TraceCheckUtils]: 40: Hoare triple {1367#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1367#false} is VALID [2020-07-17 22:48:50,098 INFO L280 TraceCheckUtils]: 41: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-17 22:48:50,102 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-17 22:48:50,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:50,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2020-07-17 22:48:50,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080842266] [2020-07-17 22:48:50,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-17 22:48:50,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:50,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:48:50,152 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-17 22:48:50,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:48:50,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:48:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:48:50,154 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2020-07-17 22:48:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:50,386 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-17 22:48:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:48:50,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-17 22:48:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-17 22:48:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-17 22:48:50,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2020-07-17 22:48:50,480 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-17 22:48:50,483 INFO L225 Difference]: With dead ends: 65 [2020-07-17 22:48:50,484 INFO L226 Difference]: Without dead ends: 43 [2020-07-17 22:48:50,484 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-17 22:48:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-17 22:48:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-17 22:48:50,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:50,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-17 22:48:50,545 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-17 22:48:50,546 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-17 22:48:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:50,549 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-17 22:48:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-17 22:48:50,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:50,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:50,550 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-17 22:48:50,550 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-17 22:48:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:50,553 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-17 22:48:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-17 22:48:50,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:50,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:50,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:50,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:48:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2020-07-17 22:48:50,557 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 42 [2020-07-17 22:48:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:50,557 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2020-07-17 22:48:50,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:48:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2020-07-17 22:48:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 22:48:50,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:50,558 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-17 22:48:50,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:50,774 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -12268618, now seen corresponding path program 1 times [2020-07-17 22:48:50,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:50,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985391216] [2020-07-17 22:48:50,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,882 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-17 22:48:50,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:50,883 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-17 22:48:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,903 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-17 22:48:50,903 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-17 22:48:50,904 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-17 22:48:50,904 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-17 22:48:50,904 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-17 22:48:50,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(~i~0 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:50,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:50,906 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,955 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-17 22:48:50,956 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-17 22:48:50,957 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-17 22:48:50,958 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-17 22:48:50,958 INFO L280 TraceCheckUtils]: 4: Hoare triple {1799#(<= rangesum_~i~1 1)} assume !(~i~1 < ~N~0); {1800#(<= ~N~0 1)} is VALID [2020-07-17 22:48:50,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {1800#(<= ~N~0 1)} assume !(0 != ~cnt~0);#res := 0; {1800#(<= ~N~0 1)} is VALID [2020-07-17 22:48:50,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {1800#(<= ~N~0 1)} assume true; {1800#(<= ~N~0 1)} is VALID [2020-07-17 22:48:50,961 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1800#(<= ~N~0 1)} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-17 22:48:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,970 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-17 22:48:50,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:50,971 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-17 22:48:50,971 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-17 22:48:50,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:50,971 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-17 22:48:50,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:50,972 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1759#false} #93#return; {1759#false} is VALID [2020-07-17 22:48:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,980 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-17 22:48:50,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:50,981 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-17 22:48:50,981 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-17 22:48:50,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:50,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-17 22:48:50,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:50,982 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1758#true} {1759#false} #95#return; {1759#false} is VALID [2020-07-17 22:48:50,983 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-17 22:48:50,984 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-17 22:48:50,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:50,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-17 22:48:50,984 INFO L263 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret13 := main(); {1758#true} is VALID [2020-07-17 22:48:50,985 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-17 22:48:50,986 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-17 22:48:50,988 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-17 22:48:50,988 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-17 22:48:50,989 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-17 22:48:50,989 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-17 22:48:50,989 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-17 22:48:50,989 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-17 22:48:50,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {1758#true} assume !(~i~0 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:50,990 INFO L280 TraceCheckUtils]: 14: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:50,991 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1758#true} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:50,991 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-17 22:48:50,992 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-17 22:48:50,992 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-17 22:48:50,993 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-17 22:48:50,994 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-17 22:48:50,995 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-17 22:48:50,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {1799#(<= rangesum_~i~1 1)} assume !(~i~1 < ~N~0); {1800#(<= ~N~0 1)} is VALID [2020-07-17 22:48:50,997 INFO L280 TraceCheckUtils]: 23: Hoare triple {1800#(<= ~N~0 1)} assume !(0 != ~cnt~0);#res := 0; {1800#(<= ~N~0 1)} is VALID [2020-07-17 22:48:50,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {1800#(<= ~N~0 1)} assume true; {1800#(<= ~N~0 1)} is VALID [2020-07-17 22:48:50,999 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1800#(<= ~N~0 1)} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-17 22:48:50,999 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-17 22:48:50,999 INFO L263 TraceCheckUtils]: 27: Hoare triple {1759#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-17 22:48:50,999 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-17 22:48:51,000 INFO L280 TraceCheckUtils]: 29: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:51,000 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-17 22:48:51,000 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-17 22:48:51,000 INFO L280 TraceCheckUtils]: 32: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:51,001 INFO L280 TraceCheckUtils]: 33: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-17 22:48:51,001 INFO L280 TraceCheckUtils]: 34: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:51,001 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1758#true} {1759#false} #93#return; {1759#false} is VALID [2020-07-17 22:48:51,001 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-17 22:48:51,002 INFO L280 TraceCheckUtils]: 37: Hoare triple {1759#false} assume !(~i~2 < ~N~0 - 1); {1759#false} is VALID [2020-07-17 22:48:51,002 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-17 22:48:51,002 INFO L263 TraceCheckUtils]: 39: Hoare triple {1759#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1758#true} is VALID [2020-07-17 22:48:51,002 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-17 22:48:51,002 INFO L280 TraceCheckUtils]: 41: Hoare triple {1758#true} assume !!(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:51,003 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-17 22:48:51,003 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-17 22:48:51,003 INFO L280 TraceCheckUtils]: 44: Hoare triple {1758#true} assume !(~i~1 < ~N~0); {1758#true} is VALID [2020-07-17 22:48:51,003 INFO L280 TraceCheckUtils]: 45: Hoare triple {1758#true} assume !(0 != ~cnt~0);#res := 0; {1758#true} is VALID [2020-07-17 22:48:51,003 INFO L280 TraceCheckUtils]: 46: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:51,004 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1758#true} {1759#false} #95#return; {1759#false} is VALID [2020-07-17 22:48:51,004 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-17 22:48:51,004 INFO L280 TraceCheckUtils]: 49: Hoare triple {1759#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1759#false} is VALID [2020-07-17 22:48:51,004 INFO L280 TraceCheckUtils]: 50: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2020-07-17 22:48:51,007 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-17 22:48:51,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985391216] [2020-07-17 22:48:51,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278123151] [2020-07-17 22:48:51,007 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-17 22:48:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:51,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1758#true} is VALID [2020-07-17 22:48:51,192 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-17 22:48:51,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2020-07-17 22:48:51,193 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #85#return; {1758#true} is VALID [2020-07-17 22:48:51,193 INFO L263 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret13 := main(); {1758#true} is VALID [2020-07-17 22:48:51,194 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-17 22:48:51,195 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-17 22:48:51,196 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-17 22:48:51,197 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-17 22:48:51,197 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-17 22:48:51,198 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-17 22:48:51,199 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-17 22:48:51,199 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-17 22:48:51,200 INFO L280 TraceCheckUtils]: 13: Hoare triple {1763#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {1763#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:51,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {1763#(<= 2 ~N~0)} assume true; {1763#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:51,202 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1763#(<= 2 ~N~0)} {1763#(<= 2 ~N~0)} #89#return; {1763#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:51,203 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-17 22:48:51,204 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-17 22:48:51,205 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-17 22:48:51,206 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-17 22:48:51,207 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-17 22:48:51,208 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-17 22:48:51,209 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-17 22:48:51,210 INFO L280 TraceCheckUtils]: 23: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-17 22:48:51,210 INFO L280 TraceCheckUtils]: 24: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-17 22:48:51,210 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1759#false} {1763#(<= 2 ~N~0)} #91#return; {1759#false} is VALID [2020-07-17 22:48:51,211 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-17 22:48:51,211 INFO L263 TraceCheckUtils]: 27: Hoare triple {1759#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {1759#false} is VALID [2020-07-17 22:48:51,211 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-17 22:48:51,212 INFO L280 TraceCheckUtils]: 29: Hoare triple {1759#false} assume !!(~i~1 < ~N~0); {1759#false} is VALID [2020-07-17 22:48:51,212 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-17 22:48:51,212 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-17 22:48:51,213 INFO L280 TraceCheckUtils]: 32: Hoare triple {1759#false} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-17 22:48:51,213 INFO L280 TraceCheckUtils]: 33: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-17 22:48:51,213 INFO L280 TraceCheckUtils]: 34: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-17 22:48:51,213 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1759#false} {1759#false} #93#return; {1759#false} is VALID [2020-07-17 22:48:51,214 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-17 22:48:51,214 INFO L280 TraceCheckUtils]: 37: Hoare triple {1759#false} assume !(~i~2 < ~N~0 - 1); {1759#false} is VALID [2020-07-17 22:48:51,214 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-17 22:48:51,214 INFO L263 TraceCheckUtils]: 39: Hoare triple {1759#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {1759#false} is VALID [2020-07-17 22:48:51,214 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-17 22:48:51,215 INFO L280 TraceCheckUtils]: 41: Hoare triple {1759#false} assume !!(~i~1 < ~N~0); {1759#false} is VALID [2020-07-17 22:48:51,215 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-17 22:48:51,215 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-17 22:48:51,215 INFO L280 TraceCheckUtils]: 44: Hoare triple {1759#false} assume !(~i~1 < ~N~0); {1759#false} is VALID [2020-07-17 22:48:51,215 INFO L280 TraceCheckUtils]: 45: Hoare triple {1759#false} assume !(0 != ~cnt~0);#res := 0; {1759#false} is VALID [2020-07-17 22:48:51,216 INFO L280 TraceCheckUtils]: 46: Hoare triple {1759#false} assume true; {1759#false} is VALID [2020-07-17 22:48:51,216 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1759#false} {1759#false} #95#return; {1759#false} is VALID [2020-07-17 22:48:51,216 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-17 22:48:51,216 INFO L280 TraceCheckUtils]: 49: Hoare triple {1759#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1759#false} is VALID [2020-07-17 22:48:51,217 INFO L280 TraceCheckUtils]: 50: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2020-07-17 22:48:51,219 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-17 22:48:51,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:51,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2020-07-17 22:48:51,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451558175] [2020-07-17 22:48:51,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-17 22:48:51,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:51,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:48:51,301 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-17 22:48:51,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:48:51,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:51,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:48:51,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:48:51,302 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2020-07-17 22:48:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:52,239 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-17 22:48:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:48:52,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-17 22:48:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:48:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2020-07-17 22:48:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:48:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2020-07-17 22:48:52,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2020-07-17 22:48:52,351 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-17 22:48:52,354 INFO L225 Difference]: With dead ends: 70 [2020-07-17 22:48:52,354 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 22:48:52,356 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-17 22:48:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 22:48:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-17 22:48:52,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:52,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-17 22:48:52,409 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-17 22:48:52,409 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-17 22:48:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:52,411 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-17 22:48:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-17 22:48:52,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:52,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:52,412 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-17 22:48:52,412 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-17 22:48:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:52,415 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-17 22:48:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-17 22:48:52,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:52,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:52,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:48:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-17 22:48:52,418 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 51 [2020-07-17 22:48:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:52,419 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-17 22:48:52,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:48:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-17 22:48:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-17 22:48:52,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:52,420 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-17 22:48:52,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:48:52,622 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash 456134489, now seen corresponding path program 2 times [2020-07-17 22:48:52,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:52,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240527615] [2020-07-17 22:48:52,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,717 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-17 22:48:52,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,718 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2222#true} {2222#true} #85#return; {2222#true} is VALID [2020-07-17 22:48:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,759 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-17 22:48:52,759 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-17 22:48:52,760 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-17 22:48:52,760 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-17 22:48:52,760 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-17 22:48:52,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {2222#true} assume !(~i~0 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,761 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #89#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,776 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-17 22:48:52,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,777 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-17 22:48:52,777 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-17 22:48:52,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,777 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-17 22:48:52,778 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-17 22:48:52,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-17 22:48:52,779 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,780 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #91#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,796 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-17 22:48:52,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,797 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-17 22:48:52,797 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-17 22:48:52,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,797 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-17 22:48:52,797 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-17 22:48:52,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-17 22:48:52,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,800 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #93#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,813 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-17 22:48:52,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,814 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-17 22:48:52,814 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-17 22:48:52,815 INFO L280 TraceCheckUtils]: 4: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,815 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-17 22:48:52,815 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-17 22:48:52,815 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,816 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-17 22:48:52,816 INFO L280 TraceCheckUtils]: 9: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,816 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2222#true} {2223#false} #95#return; {2223#false} is VALID [2020-07-17 22:48:52,818 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-17 22:48:52,818 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-17 22:48:52,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,819 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2222#true} {2222#true} #85#return; {2222#true} is VALID [2020-07-17 22:48:52,819 INFO L263 TraceCheckUtils]: 4: Hoare triple {2222#true} call #t~ret13 := main(); {2222#true} is VALID [2020-07-17 22:48:52,819 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-17 22:48:52,820 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-17 22:48:52,822 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-17 22:48:52,823 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-17 22:48:52,823 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-17 22:48:52,824 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-17 22:48:52,824 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-17 22:48:52,824 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-17 22:48:52,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {2222#true} assume !(~i~0 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,824 INFO L280 TraceCheckUtils]: 14: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,826 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #89#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:52,827 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-17 22:48:52,827 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-17 22:48:52,827 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-17 22:48:52,828 INFO L280 TraceCheckUtils]: 19: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,828 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-17 22:48:52,828 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-17 22:48:52,828 INFO L280 TraceCheckUtils]: 22: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,829 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-17 22:48:52,829 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-17 22:48:52,829 INFO L280 TraceCheckUtils]: 25: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,829 INFO L280 TraceCheckUtils]: 26: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-17 22:48:52,829 INFO L280 TraceCheckUtils]: 27: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,831 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #91#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:52,831 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-17 22:48:52,832 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-17 22:48:52,832 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-17 22:48:52,832 INFO L280 TraceCheckUtils]: 32: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,832 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-17 22:48:52,833 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-17 22:48:52,833 INFO L280 TraceCheckUtils]: 35: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,833 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-17 22:48:52,833 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-17 22:48:52,833 INFO L280 TraceCheckUtils]: 38: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,834 INFO L280 TraceCheckUtils]: 39: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-17 22:48:52,834 INFO L280 TraceCheckUtils]: 40: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,835 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2222#true} {2227#(<= 2 ~N~0)} #93#return; {2227#(<= 2 ~N~0)} is VALID [2020-07-17 22:48:52,836 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-17 22:48:52,837 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-17 22:48:52,837 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-17 22:48:52,838 INFO L263 TraceCheckUtils]: 45: Hoare triple {2223#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {2222#true} is VALID [2020-07-17 22:48:52,838 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-17 22:48:52,838 INFO L280 TraceCheckUtils]: 47: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,838 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-17 22:48:52,839 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-17 22:48:52,839 INFO L280 TraceCheckUtils]: 50: Hoare triple {2222#true} assume !!(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,839 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-17 22:48:52,839 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-17 22:48:52,839 INFO L280 TraceCheckUtils]: 53: Hoare triple {2222#true} assume !(~i~1 < ~N~0); {2222#true} is VALID [2020-07-17 22:48:52,840 INFO L280 TraceCheckUtils]: 54: Hoare triple {2222#true} assume !(0 != ~cnt~0);#res := 0; {2222#true} is VALID [2020-07-17 22:48:52,840 INFO L280 TraceCheckUtils]: 55: Hoare triple {2222#true} assume true; {2222#true} is VALID [2020-07-17 22:48:52,840 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2222#true} {2223#false} #95#return; {2223#false} is VALID [2020-07-17 22:48:52,840 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-17 22:48:52,841 INFO L280 TraceCheckUtils]: 58: Hoare triple {2223#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2223#false} is VALID [2020-07-17 22:48:52,841 INFO L280 TraceCheckUtils]: 59: Hoare triple {2223#false} assume !false; {2223#false} is VALID [2020-07-17 22:48:52,844 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-17 22:48:52,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240527615] [2020-07-17 22:48:52,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:52,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:48:52,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496815997] [2020-07-17 22:48:52,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-07-17 22:48:52,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:52,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:48:52,894 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-17 22:48:52,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:48:52,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:52,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:48:52,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:48:52,896 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 6 states. [2020-07-17 22:48:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,389 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2020-07-17 22:48:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:48:53,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-07-17 22:48:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:48:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-07-17 22:48:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:48:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-07-17 22:48:53,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2020-07-17 22:48:53,493 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-17 22:48:53,496 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:48:53,496 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:48:53,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:48:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:48:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-17 22:48:53,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:53,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2020-07-17 22:48:53,550 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2020-07-17 22:48:53,550 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2020-07-17 22:48:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,552 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-17 22:48:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:48:53,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:53,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:53,553 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2020-07-17 22:48:53,553 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2020-07-17 22:48:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,558 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-17 22:48:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:48:53,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:53,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:53,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:53,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:48:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2020-07-17 22:48:53,561 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 60 [2020-07-17 22:48:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:53,561 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2020-07-17 22:48:53,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:48:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-17 22:48:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-17 22:48:53,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:53,563 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-17 22:48:53,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:48:53,564 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash -619650601, now seen corresponding path program 1 times [2020-07-17 22:48:53,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:53,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393104180] [2020-07-17 22:48:53,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,759 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-17 22:48:53,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-17 22:48:53,760 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #85#return; {2537#true} is VALID [2020-07-17 22:48:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,775 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-17 22:48:53,775 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-17 22:48:53,776 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-17 22:48:53,776 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-17 22:48:53,776 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-17 22:48:53,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !(~i~0 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-17 22:48:53,777 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2537#true} {2537#true} #89#return; {2537#true} is VALID [2020-07-17 22:48:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,828 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-17 22:48:53,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,828 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-17 22:48:53,829 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-17 22:48:53,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,829 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-17 22:48:53,829 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-17 22:48:53,829 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,830 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-17 22:48:53,831 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-17 22:48:53,832 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-17 22:48:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,855 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-17 22:48:53,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,855 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-17 22:48:53,855 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-17 22:48:53,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,856 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-17 22:48:53,856 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-17 22:48:53,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,857 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-17 22:48:53,858 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-17 22:48:53,860 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-17 22:48:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,888 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-17 22:48:53,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,888 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-17 22:48:53,888 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-17 22:48:53,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,889 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-17 22:48:53,889 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-17 22:48:53,889 INFO L280 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,890 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-17 22:48:53,891 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-17 22:48:53,892 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-17 22:48:53,893 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-17 22:48:53,894 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-17 22:48:53,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-17 22:48:53,894 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #85#return; {2537#true} is VALID [2020-07-17 22:48:53,894 INFO L263 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret13 := main(); {2537#true} is VALID [2020-07-17 22:48:53,894 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-17 22:48:53,895 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-17 22:48:53,895 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-17 22:48:53,896 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-17 22:48:53,896 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-17 22:48:53,896 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-17 22:48:53,896 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-17 22:48:53,896 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-17 22:48:53,897 INFO L280 TraceCheckUtils]: 13: Hoare triple {2537#true} assume !(~i~0 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {2537#true} assume true; {2537#true} is VALID [2020-07-17 22:48:53,897 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2537#true} {2537#true} #89#return; {2537#true} is VALID [2020-07-17 22:48:53,897 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-17 22:48:53,897 INFO L263 TraceCheckUtils]: 17: Hoare triple {2537#true} call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); {2537#true} is VALID [2020-07-17 22:48:53,898 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-17 22:48:53,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,898 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-17 22:48:53,898 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-17 22:48:53,898 INFO L280 TraceCheckUtils]: 22: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,898 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-17 22:48:53,899 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-17 22:48:53,899 INFO L280 TraceCheckUtils]: 25: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,900 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-17 22:48:53,900 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-17 22:48:53,901 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-17 22:48:53,902 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-17 22:48:53,903 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-17 22:48:53,903 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-17 22:48:53,903 INFO L280 TraceCheckUtils]: 32: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,903 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-17 22:48:53,903 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-17 22:48:53,904 INFO L280 TraceCheckUtils]: 35: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,904 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-17 22:48:53,904 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-17 22:48:53,904 INFO L280 TraceCheckUtils]: 38: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,905 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-17 22:48:53,906 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-17 22:48:53,907 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-17 22:48:53,908 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-17 22:48:53,909 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-17 22:48:53,910 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-17 22:48:53,911 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-17 22:48:53,912 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-17 22:48:53,912 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-17 22:48:53,912 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-17 22:48:53,912 INFO L280 TraceCheckUtils]: 49: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,913 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-17 22:48:53,913 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-17 22:48:53,913 INFO L280 TraceCheckUtils]: 52: Hoare triple {2537#true} assume !!(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,913 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-17 22:48:53,913 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-17 22:48:53,913 INFO L280 TraceCheckUtils]: 55: Hoare triple {2537#true} assume !(~i~1 < ~N~0); {2537#true} is VALID [2020-07-17 22:48:53,914 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-17 22:48:53,915 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-17 22:48:53,916 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-17 22:48:53,917 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-17 22:48:53,918 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-17 22:48:53,918 INFO L280 TraceCheckUtils]: 61: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2020-07-17 22:48:53,922 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-17 22:48:53,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393104180] [2020-07-17 22:48:53,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:53,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-17 22:48:53,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091895968] [2020-07-17 22:48:53,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-17 22:48:53,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:53,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:48:53,972 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-17 22:48:53,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:48:53,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:53,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:48:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:48:53,974 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2020-07-17 22:48:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:55,126 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2020-07-17 22:48:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:48:55,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-17 22:48:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:48:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-17 22:48:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:48:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-17 22:48:55,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 73 transitions. [2020-07-17 22:48:55,238 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-17 22:48:55,243 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:48:55,243 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 22:48:55,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:48:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 22:48:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2020-07-17 22:48:55,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:55,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 56 states. [2020-07-17 22:48:55,317 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 56 states. [2020-07-17 22:48:55,317 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 56 states. [2020-07-17 22:48:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:55,323 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-17 22:48:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-17 22:48:55,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:55,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:55,324 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 70 states. [2020-07-17 22:48:55,324 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 70 states. [2020-07-17 22:48:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:55,328 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-17 22:48:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-17 22:48:55,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:55,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:55,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:55,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:48:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2020-07-17 22:48:55,332 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 62 [2020-07-17 22:48:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:55,333 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-07-17 22:48:55,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:48:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2020-07-17 22:48:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-17 22:48:55,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:55,334 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-17 22:48:55,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:48:55,334 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1679269433, now seen corresponding path program 1 times [2020-07-17 22:48:55,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:55,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686051359] [2020-07-17 22:48:55,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:55,354 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:55,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282805117] [2020-07-17 22:48:55,355 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-17 22:48:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:48:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:55,640 INFO L263 TraceCheckUtils]: 0: Hoare triple {2922#true} call ULTIMATE.init(); {2922#true} is VALID [2020-07-17 22:48:55,641 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-17 22:48:55,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {2922#true} assume true; {2922#true} is VALID [2020-07-17 22:48:55,641 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2922#true} {2922#true} #85#return; {2922#true} is VALID [2020-07-17 22:48:55,641 INFO L263 TraceCheckUtils]: 4: Hoare triple {2922#true} call #t~ret13 := main(); {2922#true} is VALID [2020-07-17 22:48:55,641 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-17 22:48:55,642 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-17 22:48:55,642 INFO L263 TraceCheckUtils]: 7: Hoare triple {2922#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2922#true} is VALID [2020-07-17 22:48:55,643 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-17 22:48:55,644 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-17 22:48:55,645 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-17 22:48:55,646 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-17 22:48:55,647 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-17 22:48:55,649 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-17 22:48:55,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,651 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2969#(<= ~N~0 2)} {2922#true} #89#return; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,651 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-17 22:48:55,652 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-17 22:48:55,653 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-17 22:48:55,654 INFO L280 TraceCheckUtils]: 19: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,654 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-17 22:48:55,655 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-17 22:48:55,655 INFO L280 TraceCheckUtils]: 22: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,656 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-17 22:48:55,656 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-17 22:48:55,657 INFO L280 TraceCheckUtils]: 25: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,658 INFO L280 TraceCheckUtils]: 26: Hoare triple {2969#(<= ~N~0 2)} assume !(0 != ~cnt~0);#res := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,659 INFO L280 TraceCheckUtils]: 27: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,660 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2969#(<= ~N~0 2)} {2969#(<= ~N~0 2)} #91#return; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,661 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-17 22:48:55,662 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-17 22:48:55,663 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-17 22:48:55,663 INFO L280 TraceCheckUtils]: 32: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,664 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-17 22:48:55,664 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-17 22:48:55,665 INFO L280 TraceCheckUtils]: 35: Hoare triple {2969#(<= ~N~0 2)} assume !!(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,665 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-17 22:48:55,666 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-17 22:48:55,667 INFO L280 TraceCheckUtils]: 38: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~1 < ~N~0); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,667 INFO L280 TraceCheckUtils]: 39: Hoare triple {2969#(<= ~N~0 2)} assume !(0 != ~cnt~0);#res := 0; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,668 INFO L280 TraceCheckUtils]: 40: Hoare triple {2969#(<= ~N~0 2)} assume true; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,669 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2969#(<= ~N~0 2)} {2969#(<= ~N~0 2)} #93#return; {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,669 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-17 22:48:55,670 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-17 22:48:55,671 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-17 22:48:55,671 INFO L280 TraceCheckUtils]: 45: Hoare triple {2969#(<= ~N~0 2)} assume !(~i~2 < ~N~0 - 1); {2969#(<= ~N~0 2)} is VALID [2020-07-17 22:48:55,672 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-17 22:48:55,673 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-17 22:48:55,674 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-17 22:48:55,675 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-17 22:48:55,676 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-17 22:48:55,677 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-17 22:48:55,679 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-17 22:48:55,682 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-17 22:48:55,684 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-17 22:48:55,685 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-17 22:48:55,685 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-17 22:48:55,685 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-17 22:48:55,685 INFO L280 TraceCheckUtils]: 58: Hoare triple {2923#false} assume !(~i~1 < ~N~0); {2923#false} is VALID [2020-07-17 22:48:55,685 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-17 22:48:55,685 INFO L280 TraceCheckUtils]: 60: Hoare triple {2923#false} assume true; {2923#false} is VALID [2020-07-17 22:48:55,685 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2923#false} {2969#(<= ~N~0 2)} #95#return; {2923#false} is VALID [2020-07-17 22:48:55,686 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-17 22:48:55,686 INFO L280 TraceCheckUtils]: 63: Hoare triple {2923#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2923#false} is VALID [2020-07-17 22:48:55,686 INFO L280 TraceCheckUtils]: 64: Hoare triple {2923#false} assume !false; {2923#false} is VALID [2020-07-17 22:48:55,690 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-17 22:48:55,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686051359] [2020-07-17 22:48:55,691 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:55,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282805117] [2020-07-17 22:48:55,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:55,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:48:55,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269170699] [2020-07-17 22:48:55,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-17 22:48:55,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:55,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:48:55,768 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-17 22:48:55,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:48:55,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:48:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:48:55,769 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 9 states. [2020-07-17 22:48:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,199 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2020-07-17 22:48:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:48:56,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-17 22:48:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:48:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-17 22:48:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:48:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-17 22:48:56,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2020-07-17 22:48:56,341 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-17 22:48:56,345 INFO L225 Difference]: With dead ends: 120 [2020-07-17 22:48:56,345 INFO L226 Difference]: Without dead ends: 59 [2020-07-17 22:48:56,347 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-17 22:48:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-17 22:48:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-17 22:48:56,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:56,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2020-07-17 22:48:56,424 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2020-07-17 22:48:56,424 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2020-07-17 22:48:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,428 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-17 22:48:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-07-17 22:48:56,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,429 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2020-07-17 22:48:56,429 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2020-07-17 22:48:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,432 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-17 22:48:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-07-17 22:48:56,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:56,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-17 22:48:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2020-07-17 22:48:56,437 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 65 [2020-07-17 22:48:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:56,437 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2020-07-17 22:48:56,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:48:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-17 22:48:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 22:48:56,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:56,439 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-17 22:48:56,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:56,653 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:56,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2040052581, now seen corresponding path program 2 times [2020-07-17 22:48:56,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:56,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321271781] [2020-07-17 22:48:56,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,757 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-17 22:48:56,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-17 22:48:56,758 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3493#true} {3493#true} #85#return; {3493#true} is VALID [2020-07-17 22:48:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,813 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-17 22:48:56,814 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-17 22:48:56,815 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-17 22:48:56,816 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-17 22:48:56,817 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-17 22:48:56,821 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-17 22:48:56,822 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-17 22:48:56,823 INFO L280 TraceCheckUtils]: 7: Hoare triple {3508#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:56,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {3508#(<= 3 ~N~0)} assume true; {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:56,824 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3508#(<= 3 ~N~0)} {3493#true} #89#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,833 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-17 22:48:56,834 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-17 22:48:56,834 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-17 22:48:56,834 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-17 22:48:56,834 INFO L280 TraceCheckUtils]: 4: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-17 22:48:56,834 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-17 22:48:56,835 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-17 22:48:56,835 INFO L280 TraceCheckUtils]: 7: Hoare triple {3493#true} assume !(~i~1 < ~N~0); {3493#true} is VALID [2020-07-17 22:48:56,835 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} assume !(0 != ~cnt~0);#res := 0; {3493#true} is VALID [2020-07-17 22:48:56,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-17 22:48:56,836 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3493#true} {3508#(<= 3 ~N~0)} #91#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,845 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-17 22:48:56,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-17 22:48:56,845 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-17 22:48:56,846 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-17 22:48:56,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {3493#true} assume !!(~i~1 < ~N~0); {3493#true} is VALID [2020-07-17 22:48:56,846 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-17 22:48:56,846 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-17 22:48:56,846 INFO L280 TraceCheckUtils]: 7: Hoare triple {3493#true} assume !(~i~1 < ~N~0); {3493#true} is VALID [2020-07-17 22:48:56,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {3493#true} assume !(0 != ~cnt~0);#res := 0; {3493#true} is VALID [2020-07-17 22:48:56,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-17 22:48:56,848 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3493#true} {3508#(<= 3 ~N~0)} #93#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:56,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321271781] [2020-07-17 22:48:56,853 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-17 22:48:56,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796861753] [2020-07-17 22:48:56,853 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-17 22:48:57,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:48:57,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:57,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:48:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,040 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:57,242 INFO L263 TraceCheckUtils]: 0: Hoare triple {3493#true} call ULTIMATE.init(); {3493#true} is VALID [2020-07-17 22:48:57,243 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-17 22:48:57,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {3493#true} assume true; {3493#true} is VALID [2020-07-17 22:48:57,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3493#true} {3493#true} #85#return; {3493#true} is VALID [2020-07-17 22:48:57,244 INFO L263 TraceCheckUtils]: 4: Hoare triple {3493#true} call #t~ret13 := main(); {3493#true} is VALID [2020-07-17 22:48:57,244 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-17 22:48:57,245 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-17 22:48:57,245 INFO L263 TraceCheckUtils]: 7: Hoare triple {3493#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3493#true} is VALID [2020-07-17 22:48:57,246 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-17 22:48:57,247 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-17 22:48:57,248 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-17 22:48:57,249 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-17 22:48:57,250 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-17 22:48:57,252 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-17 22:48:57,253 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-17 22:48:57,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {3508#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:57,254 INFO L280 TraceCheckUtils]: 16: Hoare triple {3508#(<= 3 ~N~0)} assume true; {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:57,255 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3508#(<= 3 ~N~0)} {3493#true} #89#return; {3508#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:57,256 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-17 22:48:57,257 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-17 22:48:57,258 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-17 22:48:57,259 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-17 22:48:57,260 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-17 22:48:57,262 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-17 22:48:57,263 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-17 22:48:57,264 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-17 22:48:57,266 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-17 22:48:57,268 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-17 22:48:57,268 INFO L280 TraceCheckUtils]: 28: Hoare triple {3494#false} assume !(0 != ~cnt~0);#res := 0; {3494#false} is VALID [2020-07-17 22:48:57,269 INFO L280 TraceCheckUtils]: 29: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-17 22:48:57,269 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3494#false} {3508#(<= 3 ~N~0)} #91#return; {3494#false} is VALID [2020-07-17 22:48:57,269 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-17 22:48:57,270 INFO L263 TraceCheckUtils]: 32: Hoare triple {3494#false} call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); {3494#false} is VALID [2020-07-17 22:48:57,270 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-17 22:48:57,270 INFO L280 TraceCheckUtils]: 34: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,270 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-17 22:48:57,271 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-17 22:48:57,271 INFO L280 TraceCheckUtils]: 37: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,272 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-17 22:48:57,272 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-17 22:48:57,272 INFO L280 TraceCheckUtils]: 40: Hoare triple {3494#false} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,273 INFO L280 TraceCheckUtils]: 41: Hoare triple {3494#false} assume !(0 != ~cnt~0);#res := 0; {3494#false} is VALID [2020-07-17 22:48:57,273 INFO L280 TraceCheckUtils]: 42: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-17 22:48:57,273 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3494#false} {3494#false} #93#return; {3494#false} is VALID [2020-07-17 22:48:57,273 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-17 22:48:57,274 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-17 22:48:57,274 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-17 22:48:57,274 INFO L280 TraceCheckUtils]: 47: Hoare triple {3494#false} assume !(~i~2 < ~N~0 - 1); {3494#false} is VALID [2020-07-17 22:48:57,274 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-17 22:48:57,274 INFO L263 TraceCheckUtils]: 49: Hoare triple {3494#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {3494#false} is VALID [2020-07-17 22:48:57,275 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-17 22:48:57,275 INFO L280 TraceCheckUtils]: 51: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,275 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-17 22:48:57,275 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-17 22:48:57,275 INFO L280 TraceCheckUtils]: 54: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,276 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-17 22:48:57,276 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-17 22:48:57,276 INFO L280 TraceCheckUtils]: 57: Hoare triple {3494#false} assume !!(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,276 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-17 22:48:57,277 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-17 22:48:57,277 INFO L280 TraceCheckUtils]: 60: Hoare triple {3494#false} assume !(~i~1 < ~N~0); {3494#false} is VALID [2020-07-17 22:48:57,277 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-17 22:48:57,277 INFO L280 TraceCheckUtils]: 62: Hoare triple {3494#false} assume true; {3494#false} is VALID [2020-07-17 22:48:57,277 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3494#false} {3494#false} #95#return; {3494#false} is VALID [2020-07-17 22:48:57,278 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-17 22:48:57,278 INFO L280 TraceCheckUtils]: 65: Hoare triple {3494#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3494#false} is VALID [2020-07-17 22:48:57,278 INFO L280 TraceCheckUtils]: 66: Hoare triple {3494#false} assume !false; {3494#false} is VALID [2020-07-17 22:48:57,282 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-17 22:48:57,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:57,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:48:57,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334914715] [2020-07-17 22:48:57,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-17 22:48:57,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:57,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:48:57,364 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-17 22:48:57,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:48:57,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:57,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:48:57,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:48:57,365 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 9 states. [2020-07-17 22:48:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,815 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-17 22:48:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:48:57,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-17 22:48:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:48:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-17 22:48:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:48:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-17 22:48:57,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-17 22:48:57,940 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-17 22:48:57,943 INFO L225 Difference]: With dead ends: 99 [2020-07-17 22:48:57,944 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 22:48:57,945 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-17 22:48:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 22:48:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2020-07-17 22:48:58,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:58,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 60 states. [2020-07-17 22:48:58,024 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 60 states. [2020-07-17 22:48:58,024 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 60 states. [2020-07-17 22:48:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,027 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2020-07-17 22:48:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-07-17 22:48:58,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,028 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 63 states. [2020-07-17 22:48:58,028 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 63 states. [2020-07-17 22:48:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,031 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2020-07-17 22:48:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-07-17 22:48:58,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:58,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 22:48:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2020-07-17 22:48:58,035 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 67 [2020-07-17 22:48:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:58,035 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2020-07-17 22:48:58,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:48:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-07-17 22:48:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-17 22:48:58,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,037 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-17 22:48:58,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 22:48:58,251 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash -737365673, now seen corresponding path program 1 times [2020-07-17 22:48:58,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:58,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825814337] [2020-07-17 22:48:58,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:58,265 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:58,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313887837] [2020-07-17 22:48:58,266 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-17 22:48:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:48:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,348 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:58,506 INFO L263 TraceCheckUtils]: 0: Hoare triple {4104#true} call ULTIMATE.init(); {4104#true} is VALID [2020-07-17 22:48:58,507 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-17 22:48:58,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {4104#true} assume true; {4104#true} is VALID [2020-07-17 22:48:58,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4104#true} {4104#true} #85#return; {4104#true} is VALID [2020-07-17 22:48:58,507 INFO L263 TraceCheckUtils]: 4: Hoare triple {4104#true} call #t~ret13 := main(); {4104#true} is VALID [2020-07-17 22:48:58,507 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-17 22:48:58,508 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-17 22:48:58,508 INFO L263 TraceCheckUtils]: 7: Hoare triple {4104#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4104#true} is VALID [2020-07-17 22:48:58,509 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-17 22:48:58,509 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-17 22:48:58,510 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-17 22:48:58,511 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-17 22:48:58,511 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-17 22:48:58,512 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-17 22:48:58,512 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-17 22:48:58,513 INFO L280 TraceCheckUtils]: 15: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,513 INFO L280 TraceCheckUtils]: 16: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,530 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4151#(<= 3 ~N~0)} {4104#true} #89#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,531 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-17 22:48:58,531 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-17 22:48:58,532 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-17 22:48:58,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,533 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-17 22:48:58,533 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-17 22:48:58,533 INFO L280 TraceCheckUtils]: 24: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,534 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-17 22:48:58,534 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-17 22:48:58,534 INFO L280 TraceCheckUtils]: 27: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,535 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-17 22:48:58,536 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-17 22:48:58,536 INFO L280 TraceCheckUtils]: 30: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,537 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-17 22:48:58,537 INFO L280 TraceCheckUtils]: 32: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,538 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4151#(<= 3 ~N~0)} {4151#(<= 3 ~N~0)} #91#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,538 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-17 22:48:58,538 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-17 22:48:58,539 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-17 22:48:58,539 INFO L280 TraceCheckUtils]: 37: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,539 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-17 22:48:58,540 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-17 22:48:58,540 INFO L280 TraceCheckUtils]: 40: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,541 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-17 22:48:58,541 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-17 22:48:58,542 INFO L280 TraceCheckUtils]: 43: Hoare triple {4151#(<= 3 ~N~0)} assume !!(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,542 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-17 22:48:58,543 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-17 22:48:58,548 INFO L280 TraceCheckUtils]: 46: Hoare triple {4151#(<= 3 ~N~0)} assume !(~i~1 < ~N~0); {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,549 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-17 22:48:58,549 INFO L280 TraceCheckUtils]: 48: Hoare triple {4151#(<= 3 ~N~0)} assume true; {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,550 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4151#(<= 3 ~N~0)} {4151#(<= 3 ~N~0)} #93#return; {4151#(<= 3 ~N~0)} is VALID [2020-07-17 22:48:58,551 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-17 22:48:58,552 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-17 22:48:58,554 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-17 22:48:58,554 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-17 22:48:58,555 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-17 22:48:58,555 INFO L263 TraceCheckUtils]: 55: Hoare triple {4105#false} call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); {4105#false} is VALID [2020-07-17 22:48:58,555 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-17 22:48:58,555 INFO L280 TraceCheckUtils]: 57: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-17 22:48:58,555 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-17 22:48:58,555 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-17 22:48:58,556 INFO L280 TraceCheckUtils]: 60: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-17 22:48:58,556 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-17 22:48:58,556 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-17 22:48:58,556 INFO L280 TraceCheckUtils]: 63: Hoare triple {4105#false} assume !!(~i~1 < ~N~0); {4105#false} is VALID [2020-07-17 22:48:58,556 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-17 22:48:58,556 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-17 22:48:58,557 INFO L280 TraceCheckUtils]: 66: Hoare triple {4105#false} assume !(~i~1 < ~N~0); {4105#false} is VALID [2020-07-17 22:48:58,557 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-17 22:48:58,557 INFO L280 TraceCheckUtils]: 68: Hoare triple {4105#false} assume true; {4105#false} is VALID [2020-07-17 22:48:58,557 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4105#false} {4105#false} #95#return; {4105#false} is VALID [2020-07-17 22:48:58,557 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-17 22:48:58,558 INFO L280 TraceCheckUtils]: 71: Hoare triple {4105#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4105#false} is VALID [2020-07-17 22:48:58,558 INFO L280 TraceCheckUtils]: 72: Hoare triple {4105#false} assume !false; {4105#false} is VALID [2020-07-17 22:48:58,562 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-17 22:48:58,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825814337] [2020-07-17 22:48:58,563 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:58,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313887837] [2020-07-17 22:48:58,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:58,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:48:58,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686907082] [2020-07-17 22:48:58,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-17 22:48:58,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:58,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:48:58,641 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-17 22:48:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:48:58,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:48:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:48:58,642 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 8 states. [2020-07-17 22:48:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:59,320 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2020-07-17 22:48:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:48:59,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-17 22:48:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:48:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-17 22:48:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:48:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-17 22:48:59,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2020-07-17 22:48:59,424 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-17 22:48:59,426 INFO L225 Difference]: With dead ends: 94 [2020-07-17 22:48:59,426 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 22:48:59,427 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-17 22:48:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 22:48:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-17 22:48:59,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:59,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-17 22:48:59,500 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-17 22:48:59,500 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-17 22:48:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:59,503 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-17 22:48:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-17 22:48:59,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:59,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:59,505 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-17 22:48:59,505 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-17 22:48:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:59,508 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-17 22:48:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-17 22:48:59,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:59,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:59,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:59,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 22:48:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2020-07-17 22:48:59,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 73 [2020-07-17 22:48:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:59,515 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2020-07-17 22:48:59,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:48:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-07-17 22:48:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-17 22:48:59,516 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:59,516 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-17 22:48:59,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-17 22:48:59,730 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 132738585, now seen corresponding path program 2 times [2020-07-17 22:48:59,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:59,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625231291] [2020-07-17 22:48:59,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,744 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:59,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356201782] [2020-07-17 22:48:59,745 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-17 22:49:00,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:49:00,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-17 22:49:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:00,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:00,138 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:00,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:00,438 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:00,438 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:00,438 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:49:00,439 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:49:00,440 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L7-4 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:00,441 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-17 22:49:00,442 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:49:00,443 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:49:00,443 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:49:00,443 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-17 22:49:00,443 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:00,443 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:00,443 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-17 22:49:00,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:00 BoogieIcfgContainer [2020-07-17 22:49:00,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:00,448 INFO L168 Benchmark]: Toolchain (without parser) took 17218.09 ms. Allocated memory was 136.3 MB in the beginning and 380.1 MB in the end (delta: 243.8 MB). Free memory was 100.9 MB in the beginning and 191.2 MB in the end (delta: -90.4 MB). Peak memory consumption was 153.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,449 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 136.3 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:49:00,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.41 ms. Allocated memory is still 136.3 MB. Free memory was 100.5 MB in the beginning and 89.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,450 INFO L168 Benchmark]: Boogie Preprocessor took 135.93 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.7 MB in the beginning and 177.1 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,451 INFO L168 Benchmark]: RCFGBuilder took 590.66 ms. Allocated memory is still 199.8 MB. Free memory was 177.1 MB in the beginning and 146.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,451 INFO L168 Benchmark]: TraceAbstraction took 16165.32 ms. Allocated memory was 199.8 MB in the beginning and 380.1 MB in the end (delta: 180.4 MB). Free memory was 146.3 MB in the beginning and 191.2 MB in the end (delta: -45.0 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,453 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 136.3 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.41 ms. Allocated memory is still 136.3 MB. Free memory was 100.5 MB in the beginning and 89.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.93 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.7 MB in the beginning and 177.1 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 590.66 ms. Allocated memory is still 199.8 MB. Free memory was 177.1 MB in the beginning and 146.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16165.32 ms. Allocated memory was 199.8 MB in the beginning and 380.1 MB in the end (delta: 180.4 MB). Free memory was 146.3 MB in the beginning and 191.2 MB in the end (delta: -45.0 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int N; VAL [\old(N)=5, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={2:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={2:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={2:0}, x={2:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={2:0}, x={2:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={2:0}, x={2:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={2:0}, x={2:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={2:0}, x={2:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={2:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={2:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={2:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147483647, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=2147483647, x={2:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=2147483647, temp=2147483645, x={2:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={2:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147483647, cnt=1, i=3, N=3, ret=2147483647, x={2:0}, x={2:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=2147483647, ret=2147483647, temp=2147483645, x={2:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=2147483647, ret2=2147483647, temp=2147483646, x={2:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={2:0}, x={2:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147483646, x={2:0}, x={2:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483646, x={2:0}, x={2:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147483646, x={2:0}, x={2:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147483646, cnt=1, i=3, N=3, ret=2147483646, x={2:0}, x={2:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=2147483646, ret=2147483647, ret2=2147483647, temp=2147483646, x={2:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=2147483647, ret2=2147483647, ret5=2147483646, temp=2147483646, x={2:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=2147483647, ret2=2147483647, ret5=2147483646, temp=2147483646, x={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.9s, OverallIterations: 12, TraceHistogramMax: 9, AutomataDifference: 7.8s, 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.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.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...