java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:17:32,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:17:32,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:17:32,723 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:17:32,723 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:17:32,724 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:17:32,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:17:32,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:17:32,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:17:32,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:17:32,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:17:32,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:17:32,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:17:32,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:17:32,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:17:32,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:17:32,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:17:32,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:17:32,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:17:32,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:17:32,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:17:32,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:17:32,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:17:32,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:17:32,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:17:32,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:17:32,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:17:32,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:17:32,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:17:32,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:17:32,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:17:32,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:17:32,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:17:32,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:17:32,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:17:32,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:17:32,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:17:32,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:17:32,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:17:32,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:17:32,814 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:17:32,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:17:32,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:17:32,816 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:17:32,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:17:32,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:17:32,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:17:32,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:17:32,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:17:32,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:17:32,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:17:32,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:17:32,817 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:17:32,819 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:17:32,819 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:17:32,819 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:17:32,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:17:32,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:17:32,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:17:32,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:17:32,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:17:32,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:17:32,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:17:32,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:17:32,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:17:32,822 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:17:32,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:17:32,822 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:17:32,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:17:32,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:17:32,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:17:32,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:17:32,906 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:17:32,907 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-23 12:17:32,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69e895b4/f63143aee8c641df9af510f0dd19dd4c/FLAG15aa7a164 [2018-11-23 12:17:33,407 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:17:33,408 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-23 12:17:33,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69e895b4/f63143aee8c641df9af510f0dd19dd4c/FLAG15aa7a164 [2018-11-23 12:17:33,785 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69e895b4/f63143aee8c641df9af510f0dd19dd4c [2018-11-23 12:17:33,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:17:33,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:17:33,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:17:33,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:17:33,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:17:33,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:17:33" (1/1) ... [2018-11-23 12:17:33,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a99adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:33, skipping insertion in model container [2018-11-23 12:17:33,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:17:33" (1/1) ... [2018-11-23 12:17:33,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:17:33,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:17:34,059 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:17:34,072 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:17:34,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:17:34,119 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:17:34,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34 WrapperNode [2018-11-23 12:17:34,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:17:34,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:17:34,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:17:34,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:17:34,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:17:34,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:17:34,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:17:34,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:17:34,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (1/1) ... [2018-11-23 12:17:34,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:17:34,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:17:34,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:17:34,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:17:34,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (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 [2018-11-23 12:17:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:17:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:17:34,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:17:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:17:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:17:34,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:17:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:17:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 12:17:34,322 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 12:17:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:17:34,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:17:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:17:34,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:17:34,973 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:17:34,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:17:34 BoogieIcfgContainer [2018-11-23 12:17:34,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:17:34,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:17:34,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:17:34,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:17:34,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:17:33" (1/3) ... [2018-11-23 12:17:34,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b101f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:17:34, skipping insertion in model container [2018-11-23 12:17:34,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:17:34" (2/3) ... [2018-11-23 12:17:34,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b101f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:17:34, skipping insertion in model container [2018-11-23 12:17:34,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:17:34" (3/3) ... [2018-11-23 12:17:34,983 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-11-23 12:17:34,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:17:35,001 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:17:35,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:17:35,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:17:35,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:17:35,060 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:17:35,060 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:17:35,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:17:35,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:17:35,061 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:17:35,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:17:35,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:17:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:17:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:17:35,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:35,092 INFO L402 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] [2018-11-23 12:17:35,094 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:35,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1754504496, now seen corresponding path program 1 times [2018-11-23 12:17:35,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:35,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:35,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:17:35,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:17:35,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:17:35,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:17:35,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret11 := main(); {34#true} is VALID [2018-11-23 12:17:35,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2018-11-23 12:17:35,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {34#true} is VALID [2018-11-23 12:17:35,316 INFO L256 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:17:35,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:17:35,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:17:35,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:17:35,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:17:35,330 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {34#true} #64#return; {35#false} is VALID [2018-11-23 12:17:35,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:17:35,331 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:17:35,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:17:35,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:17:35,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:17:35,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:17:35,333 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:17:35,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {35#false} is VALID [2018-11-23 12:17:35,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:17:35,334 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:17:35,334 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:17:35,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:17:35,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:17:35,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:17:35,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:17:35,336 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:17:35,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {35#false} is VALID [2018-11-23 12:17:35,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 12:17:35,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:17:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:17:35,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:35,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:35,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:35,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:35,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:17:35,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:17:35,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:17:35,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:17:35,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret11 := main(); {34#true} is VALID [2018-11-23 12:17:35,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2018-11-23 12:17:35,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {34#true} is VALID [2018-11-23 12:17:35,757 INFO L256 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:17:35,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:17:35,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:17:35,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:17:35,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:17:35,758 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {34#true} #64#return; {35#false} is VALID [2018-11-23 12:17:35,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:17:35,759 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:17:35,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35#false} is VALID [2018-11-23 12:17:35,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:17:35,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:17:35,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:17:35,761 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:17:35,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {35#false} is VALID [2018-11-23 12:17:35,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:17:35,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:17:35,762 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:17:35,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35#false} is VALID [2018-11-23 12:17:35,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:17:35,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:17:35,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:17:35,764 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:17:35,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {35#false} is VALID [2018-11-23 12:17:35,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 12:17:35,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:17:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:17:35,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:17:35,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-11-23 12:17:35,805 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:17:35,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:35,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:17:36,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:36,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:17:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:17:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:17:36,019 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:17:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:36,156 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 12:17:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:17:36,157 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:17:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:17:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 12:17:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:17:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 12:17:36,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-23 12:17:36,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:36,479 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:17:36,479 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:17:36,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:17:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:17:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:17:36,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:36,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:17:36,656 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:17:36,657 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:17:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:36,663 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:17:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:17:36,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:36,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:36,664 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:17:36,665 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:17:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:36,670 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:17:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:17:36,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:36,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:36,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:36,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:17:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 12:17:36,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 32 [2018-11-23 12:17:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:36,678 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 12:17:36,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:17:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:17:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:17:36,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:36,680 INFO L402 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] [2018-11-23 12:17:36,681 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:36,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 614035178, now seen corresponding path program 1 times [2018-11-23 12:17:36,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:36,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:36,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:36,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:37,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-23 12:17:37,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {285#true} is VALID [2018-11-23 12:17:37,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:17:37,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2018-11-23 12:17:37,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret11 := main(); {285#true} is VALID [2018-11-23 12:17:37,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {285#true} is VALID [2018-11-23 12:17:37,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {285#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {287#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:37,184 INFO L256 TraceCheckUtils]: 7: Hoare triple {287#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {285#true} is VALID [2018-11-23 12:17:37,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {285#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {288#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:37,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {288#(= sum_~i~0 0)} assume !(~i~0 < ~N~0); {289#(<= ~N~0 0)} is VALID [2018-11-23 12:17:37,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {289#(<= ~N~0 0)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {289#(<= ~N~0 0)} is VALID [2018-11-23 12:17:37,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {289#(<= ~N~0 0)} assume true; {289#(<= ~N~0 0)} is VALID [2018-11-23 12:17:37,195 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {289#(<= ~N~0 0)} {287#(<= 2 ~N~0)} #64#return; {286#false} is VALID [2018-11-23 12:17:37,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {286#false} is VALID [2018-11-23 12:17:37,196 INFO L256 TraceCheckUtils]: 14: Hoare triple {286#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {285#true} is VALID [2018-11-23 12:17:37,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {285#true} is VALID [2018-11-23 12:17:37,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {285#true} assume !(~i~0 < ~N~0); {285#true} is VALID [2018-11-23 12:17:37,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {285#true} is VALID [2018-11-23 12:17:37,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:17:37,197 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {285#true} {286#false} #66#return; {286#false} is VALID [2018-11-23 12:17:37,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {286#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {286#false} is VALID [2018-11-23 12:17:37,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {286#false} assume !(~i~1 < ~N~0 - 1); {286#false} is VALID [2018-11-23 12:17:37,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {286#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {286#false} is VALID [2018-11-23 12:17:37,199 INFO L256 TraceCheckUtils]: 23: Hoare triple {286#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {285#true} is VALID [2018-11-23 12:17:37,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {285#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {285#true} is VALID [2018-11-23 12:17:37,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {285#true} assume !(~i~0 < ~N~0); {285#true} is VALID [2018-11-23 12:17:37,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {285#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {285#true} is VALID [2018-11-23 12:17:37,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:17:37,201 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {285#true} {286#false} #68#return; {286#false} is VALID [2018-11-23 12:17:37,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {286#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {286#false} is VALID [2018-11-23 12:17:37,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {286#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {286#false} is VALID [2018-11-23 12:17:37,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-23 12:17:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:17:37,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:37,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:37,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:37,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:37,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-23 12:17:37,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {285#true} is VALID [2018-11-23 12:17:37,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:17:37,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2018-11-23 12:17:37,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret11 := main(); {285#true} is VALID [2018-11-23 12:17:37,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {285#true} is VALID [2018-11-23 12:17:37,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {285#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {287#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:37,511 INFO L256 TraceCheckUtils]: 7: Hoare triple {287#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {287#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:37,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {317#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-23 12:17:37,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {317#(and (<= sum_~i~0 0) (<= 2 ~N~0))} assume !(~i~0 < ~N~0); {286#false} is VALID [2018-11-23 12:17:37,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {286#false} is VALID [2018-11-23 12:17:37,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 12:17:37,535 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {286#false} {287#(<= 2 ~N~0)} #64#return; {286#false} is VALID [2018-11-23 12:17:37,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {286#false} is VALID [2018-11-23 12:17:37,535 INFO L256 TraceCheckUtils]: 14: Hoare triple {286#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {286#false} is VALID [2018-11-23 12:17:37,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {286#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {286#false} is VALID [2018-11-23 12:17:37,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {286#false} assume !(~i~0 < ~N~0); {286#false} is VALID [2018-11-23 12:17:37,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {286#false} is VALID [2018-11-23 12:17:37,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 12:17:37,537 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {286#false} {286#false} #66#return; {286#false} is VALID [2018-11-23 12:17:37,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {286#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {286#false} is VALID [2018-11-23 12:17:37,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {286#false} assume !(~i~1 < ~N~0 - 1); {286#false} is VALID [2018-11-23 12:17:37,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {286#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {286#false} is VALID [2018-11-23 12:17:37,539 INFO L256 TraceCheckUtils]: 23: Hoare triple {286#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {286#false} is VALID [2018-11-23 12:17:37,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {286#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {286#false} is VALID [2018-11-23 12:17:37,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {286#false} assume !(~i~0 < ~N~0); {286#false} is VALID [2018-11-23 12:17:37,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {286#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {286#false} is VALID [2018-11-23 12:17:37,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 12:17:37,541 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {286#false} {286#false} #68#return; {286#false} is VALID [2018-11-23 12:17:37,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {286#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {286#false} is VALID [2018-11-23 12:17:37,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {286#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {286#false} is VALID [2018-11-23 12:17:37,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-23 12:17:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:17:37,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:17:37,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-23 12:17:37,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:17:37,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:37,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:17:37,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:37,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:17:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:17:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:17:37,840 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 12:17:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:38,316 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 12:17:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:17:38,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:17:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:17:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:17:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:17:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:17:38,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-23 12:17:38,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:38,465 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:17:38,465 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:17:38,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:17:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:17:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:17:38,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:38,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:17:38,487 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:17:38,488 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:17:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:38,492 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:17:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:17:38,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:38,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:38,493 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:17:38,493 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:17:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:38,496 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:17:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:17:38,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:38,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:38,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:38,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:17:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 12:17:38,501 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 12:17:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:38,501 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 12:17:38,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:17:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:17:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:17:38,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:38,503 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:17:38,504 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:38,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash 435243016, now seen corresponding path program 1 times [2018-11-23 12:17:38,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:38,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:38,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:38,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:38,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-23 12:17:38,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {540#true} is VALID [2018-11-23 12:17:38,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:17:38,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #60#return; {540#true} is VALID [2018-11-23 12:17:38,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret11 := main(); {540#true} is VALID [2018-11-23 12:17:38,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {540#true} is VALID [2018-11-23 12:17:38,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:38,693 INFO L256 TraceCheckUtils]: 7: Hoare triple {542#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {540#true} is VALID [2018-11-23 12:17:38,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {543#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:38,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {543#(= sum_~i~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {543#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:38,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {543#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {544#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:38,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {544#(<= sum_~i~0 1)} assume !(~i~0 < ~N~0); {545#(<= ~N~0 1)} is VALID [2018-11-23 12:17:38,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#(<= ~N~0 1)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {545#(<= ~N~0 1)} is VALID [2018-11-23 12:17:38,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {545#(<= ~N~0 1)} assume true; {545#(<= ~N~0 1)} is VALID [2018-11-23 12:17:38,699 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {545#(<= ~N~0 1)} {542#(<= 2 ~N~0)} #64#return; {541#false} is VALID [2018-11-23 12:17:38,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {541#false} is VALID [2018-11-23 12:17:38,699 INFO L256 TraceCheckUtils]: 16: Hoare triple {541#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {540#true} is VALID [2018-11-23 12:17:38,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {540#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {540#true} is VALID [2018-11-23 12:17:38,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {540#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {540#true} is VALID [2018-11-23 12:17:38,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {540#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {540#true} is VALID [2018-11-23 12:17:38,701 INFO L273 TraceCheckUtils]: 20: Hoare triple {540#true} assume !(~i~0 < ~N~0); {540#true} is VALID [2018-11-23 12:17:38,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {540#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {540#true} is VALID [2018-11-23 12:17:38,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:17:38,702 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {540#true} {541#false} #66#return; {541#false} is VALID [2018-11-23 12:17:38,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {541#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {541#false} is VALID [2018-11-23 12:17:38,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {541#false} assume !(~i~1 < ~N~0 - 1); {541#false} is VALID [2018-11-23 12:17:38,703 INFO L273 TraceCheckUtils]: 26: Hoare triple {541#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {541#false} is VALID [2018-11-23 12:17:38,703 INFO L256 TraceCheckUtils]: 27: Hoare triple {541#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {540#true} is VALID [2018-11-23 12:17:38,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {540#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {540#true} is VALID [2018-11-23 12:17:38,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {540#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {540#true} is VALID [2018-11-23 12:17:38,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {540#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {540#true} is VALID [2018-11-23 12:17:38,704 INFO L273 TraceCheckUtils]: 31: Hoare triple {540#true} assume !(~i~0 < ~N~0); {540#true} is VALID [2018-11-23 12:17:38,704 INFO L273 TraceCheckUtils]: 32: Hoare triple {540#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {540#true} is VALID [2018-11-23 12:17:38,705 INFO L273 TraceCheckUtils]: 33: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:17:38,705 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {540#true} {541#false} #68#return; {541#false} is VALID [2018-11-23 12:17:38,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {541#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {541#false} is VALID [2018-11-23 12:17:38,705 INFO L273 TraceCheckUtils]: 36: Hoare triple {541#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {541#false} is VALID [2018-11-23 12:17:38,706 INFO L273 TraceCheckUtils]: 37: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-23 12:17:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 12:17:38,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:38,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:38,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:38,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:38,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-23 12:17:38,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {540#true} is VALID [2018-11-23 12:17:38,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:17:38,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #60#return; {540#true} is VALID [2018-11-23 12:17:38,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret11 := main(); {540#true} is VALID [2018-11-23 12:17:38,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {540#true} is VALID [2018-11-23 12:17:38,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:38,951 INFO L256 TraceCheckUtils]: 7: Hoare triple {542#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:38,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {542#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {573#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-23 12:17:38,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {573#(and (<= sum_~i~0 0) (<= 2 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {573#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-23 12:17:38,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {573#(and (<= sum_~i~0 0) (<= 2 ~N~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {580#(and (<= 2 ~N~0) (<= sum_~i~0 1))} is VALID [2018-11-23 12:17:38,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {580#(and (<= 2 ~N~0) (<= sum_~i~0 1))} assume !(~i~0 < ~N~0); {541#false} is VALID [2018-11-23 12:17:38,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {541#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {541#false} is VALID [2018-11-23 12:17:38,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-23 12:17:38,960 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {541#false} {542#(<= 2 ~N~0)} #64#return; {541#false} is VALID [2018-11-23 12:17:38,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {541#false} is VALID [2018-11-23 12:17:38,960 INFO L256 TraceCheckUtils]: 16: Hoare triple {541#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {541#false} is VALID [2018-11-23 12:17:38,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {541#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {541#false} is VALID [2018-11-23 12:17:38,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {541#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {541#false} is VALID [2018-11-23 12:17:38,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {541#false} is VALID [2018-11-23 12:17:38,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {541#false} assume !(~i~0 < ~N~0); {541#false} is VALID [2018-11-23 12:17:38,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {541#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {541#false} is VALID [2018-11-23 12:17:38,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-23 12:17:38,963 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {541#false} {541#false} #66#return; {541#false} is VALID [2018-11-23 12:17:38,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {541#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {541#false} is VALID [2018-11-23 12:17:38,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {541#false} assume !(~i~1 < ~N~0 - 1); {541#false} is VALID [2018-11-23 12:17:38,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {541#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {541#false} is VALID [2018-11-23 12:17:38,964 INFO L256 TraceCheckUtils]: 27: Hoare triple {541#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {541#false} is VALID [2018-11-23 12:17:38,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {541#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {541#false} is VALID [2018-11-23 12:17:38,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {541#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {541#false} is VALID [2018-11-23 12:17:38,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {541#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {541#false} is VALID [2018-11-23 12:17:38,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {541#false} assume !(~i~0 < ~N~0); {541#false} is VALID [2018-11-23 12:17:38,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {541#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {541#false} is VALID [2018-11-23 12:17:38,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-23 12:17:38,966 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {541#false} {541#false} #68#return; {541#false} is VALID [2018-11-23 12:17:38,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {541#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {541#false} is VALID [2018-11-23 12:17:38,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {541#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {541#false} is VALID [2018-11-23 12:17:38,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-23 12:17:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 12:17:38,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:38,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 12:17:38,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 12:17:38,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:38,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:17:39,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:39,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:17:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:17:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:17:39,094 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2018-11-23 12:17:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:39,401 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 12:17:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:17:39,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 12:17:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:17:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 12:17:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:17:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 12:17:39,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-23 12:17:39,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:39,509 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:17:39,509 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:17:39,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:17:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:17:39,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:39,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:17:39,594 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:17:39,595 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:17:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:39,598 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:17:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:17:39,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:39,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:39,599 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:17:39,599 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:17:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:39,602 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:17:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:17:39,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:39,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:39,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:39,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:17:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 12:17:39,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 38 [2018-11-23 12:17:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:39,607 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 12:17:39,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:17:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:17:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:17:39,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:39,608 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:39,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:39,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1564241242, now seen corresponding path program 2 times [2018-11-23 12:17:39,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:39,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:39,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:39,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {826#true} call ULTIMATE.init(); {826#true} is VALID [2018-11-23 12:17:39,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {826#true} is VALID [2018-11-23 12:17:39,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2018-11-23 12:17:39,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {826#true} {826#true} #60#return; {826#true} is VALID [2018-11-23 12:17:39,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {826#true} call #t~ret11 := main(); {826#true} is VALID [2018-11-23 12:17:39,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {826#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {826#true} is VALID [2018-11-23 12:17:39,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {826#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {828#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:39,736 INFO L256 TraceCheckUtils]: 7: Hoare triple {828#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {826#true} is VALID [2018-11-23 12:17:39,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {826#true} is VALID [2018-11-23 12:17:39,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {826#true} is VALID [2018-11-23 12:17:39,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {826#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {826#true} is VALID [2018-11-23 12:17:39,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {826#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {826#true} is VALID [2018-11-23 12:17:39,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {826#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {826#true} is VALID [2018-11-23 12:17:39,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#true} assume !(~i~0 < ~N~0); {826#true} is VALID [2018-11-23 12:17:39,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {826#true} is VALID [2018-11-23 12:17:39,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {826#true} assume true; {826#true} is VALID [2018-11-23 12:17:39,739 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {826#true} {828#(<= 2 ~N~0)} #64#return; {828#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:39,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#(<= 2 ~N~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {828#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:39,740 INFO L256 TraceCheckUtils]: 18: Hoare triple {828#(<= 2 ~N~0)} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {826#true} is VALID [2018-11-23 12:17:39,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {826#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {826#true} is VALID [2018-11-23 12:17:39,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {826#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {826#true} is VALID [2018-11-23 12:17:39,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {826#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {826#true} is VALID [2018-11-23 12:17:39,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {826#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {826#true} is VALID [2018-11-23 12:17:39,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {826#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {826#true} is VALID [2018-11-23 12:17:39,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {826#true} assume !(~i~0 < ~N~0); {826#true} is VALID [2018-11-23 12:17:39,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {826#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {826#true} is VALID [2018-11-23 12:17:39,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {826#true} assume true; {826#true} is VALID [2018-11-23 12:17:39,744 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {826#true} {828#(<= 2 ~N~0)} #66#return; {828#(<= 2 ~N~0)} is VALID [2018-11-23 12:17:39,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {828#(<= 2 ~N~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {829#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-23 12:17:39,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {829#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {827#false} is VALID [2018-11-23 12:17:39,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {827#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {827#false} is VALID [2018-11-23 12:17:39,746 INFO L256 TraceCheckUtils]: 31: Hoare triple {827#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {826#true} is VALID [2018-11-23 12:17:39,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {826#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {826#true} is VALID [2018-11-23 12:17:39,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {826#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {826#true} is VALID [2018-11-23 12:17:39,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {826#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {826#true} is VALID [2018-11-23 12:17:39,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {826#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {826#true} is VALID [2018-11-23 12:17:39,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {826#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {826#true} is VALID [2018-11-23 12:17:39,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {826#true} assume !(~i~0 < ~N~0); {826#true} is VALID [2018-11-23 12:17:39,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {826#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {826#true} is VALID [2018-11-23 12:17:39,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {826#true} assume true; {826#true} is VALID [2018-11-23 12:17:39,748 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {826#true} {827#false} #68#return; {827#false} is VALID [2018-11-23 12:17:39,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {827#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {827#false} is VALID [2018-11-23 12:17:39,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {827#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {827#false} is VALID [2018-11-23 12:17:39,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {827#false} assume !false; {827#false} is VALID [2018-11-23 12:17:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 12:17:39,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:17:39,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:17:39,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 12:17:39,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:39,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:17:39,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:39,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:17:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:17:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:17:39,867 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-11-23 12:17:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:39,999 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:17:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:17:40,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 12:17:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:17:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:17:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:17:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:17:40,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-23 12:17:40,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:40,075 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:17:40,075 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:17:40,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:17:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:17:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:17:40,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:40,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:17:40,108 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:17:40,108 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:17:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:40,111 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:17:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:17:40,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:40,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:40,112 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:17:40,112 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:17:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:40,115 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:17:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:17:40,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:40,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:40,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:40,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:17:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 12:17:40,119 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 44 [2018-11-23 12:17:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:40,119 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 12:17:40,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:17:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:17:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:17:40,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:40,121 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 12:17:40,122 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:40,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2051797468, now seen corresponding path program 1 times [2018-11-23 12:17:40,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:40,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:40,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:41,478 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-23 12:17:42,506 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-23 12:17:43,077 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-23 12:17:45,628 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 89 DAG size of output: 29 [2018-11-23 12:17:48,339 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 107 DAG size of output: 29 [2018-11-23 12:17:50,903 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 45 [2018-11-23 12:17:51,273 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-23 12:18:00,285 WARN L180 SmtUtils]: Spent 6.18 s on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2018-11-23 12:18:10,656 WARN L180 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-11-23 12:18:11,070 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2018-11-23 12:18:11,382 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-11-23 12:18:13,126 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2018-11-23 12:18:13,406 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2018-11-23 12:18:13,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {997#true} is VALID [2018-11-23 12:18:13,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {997#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {997#true} is VALID [2018-11-23 12:18:13,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 12:18:13,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {997#true} {997#true} #60#return; {997#true} is VALID [2018-11-23 12:18:13,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {997#true} call #t~ret11 := main(); {997#true} is VALID [2018-11-23 12:18:13,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {997#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {997#true} is VALID [2018-11-23 12:18:13,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {997#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {999#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0))} is VALID [2018-11-23 12:18:13,793 INFO L256 TraceCheckUtils]: 7: Hoare triple {999#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {997#true} is VALID [2018-11-23 12:18:13,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {997#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1000#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (= sum_~x.base |sum_#in~x.base|) (= sum_~ret~0 0) (= sum_~i~0 0)) (not (= sum_~x.offset 0))))} is VALID [2018-11-23 12:18:13,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {1000#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (= sum_~x.base |sum_#in~x.base|) (= sum_~ret~0 0) (= sum_~i~0 0)) (not (= sum_~x.offset 0))))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1001#(and (or (and (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0)))) (<= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0)) (not (= sum_~x.offset 0))) (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)))} is VALID [2018-11-23 12:18:13,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {1001#(and (or (and (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0)))) (<= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0)) (not (= sum_~x.offset 0))) (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1002#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (or (and (<= (select (select |#memory_int| sum_~x.base) 0) sum_~ret~0) (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) 0))) (<= (+ sum_~x.offset (* 4 sum_~i~0)) 3)) (<= sum_~i~0 1)) (not (= sum_~x.offset 0))))} is VALID [2018-11-23 12:18:13,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {1002#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (or (and (<= (select (select |#memory_int| sum_~x.base) 0) sum_~ret~0) (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) 0))) (<= (+ sum_~x.offset (* 4 sum_~i~0)) 3)) (<= sum_~i~0 1)) (not (= sum_~x.offset 0))))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1003#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 sum_~i~0) 3) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0))) (<= (* 4 sum_~i~0) 4)))} is VALID [2018-11-23 12:18:13,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {1003#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 sum_~i~0) 3) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0))) (<= (* 4 sum_~i~0) 4)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1004#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 sum_~i~0) 8) (or (<= (* 4 sum_~i~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} is VALID [2018-11-23 12:18:13,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {1004#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 sum_~i~0) 8) (or (<= (* 4 sum_~i~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} assume !(~i~0 < ~N~0); {1005#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 ~N~0) 8) (or (<= (* 4 ~N~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} is VALID [2018-11-23 12:18:13,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1005#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 ~N~0) 8) (or (<= (* 4 ~N~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} is VALID [2018-11-23 12:18:13,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} assume true; {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} is VALID [2018-11-23 12:18:13,810 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} {999#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0))} #64#return; {1007#(and (or (<= 9 (* 4 ~N~0)) (= (+ |main_#t~ret3| (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (- 2147483648))) 4294967296)) 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} is VALID [2018-11-23 12:18:15,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {1007#(and (or (<= 9 (* 4 ~N~0)) (= (+ |main_#t~ret3| (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (- 2147483648))) 4294967296)) 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1008#(and (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (<= (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (- 2147483648))) 4294967296)) 4294967295))) (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} is UNKNOWN [2018-11-23 12:18:15,815 INFO L256 TraceCheckUtils]: 18: Hoare triple {1008#(and (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (<= (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (- 2147483648))) 4294967296)) 4294967295))) (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {997#true} is VALID [2018-11-23 12:18:15,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {997#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1009#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (= sum_~x.base |sum_#in~x.base|) (not (= sum_~x.offset 0))) (= sum_~ret~0 0) (= sum_~i~0 0))} is VALID [2018-11-23 12:18:15,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {1009#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (= sum_~x.base |sum_#in~x.base|) (not (= sum_~x.offset 0))) (= sum_~ret~0 0) (= sum_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1010#(and (or (and (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0)))) (<= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0)) (not (= sum_~x.offset 0))) (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (= sum_~i~0 0))} is VALID [2018-11-23 12:18:15,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#(and (or (and (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0)))) (<= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0)) (not (= sum_~x.offset 0))) (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (= sum_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1002#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (or (and (<= (select (select |#memory_int| sum_~x.base) 0) sum_~ret~0) (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) 0))) (<= (+ sum_~x.offset (* 4 sum_~i~0)) 3)) (<= sum_~i~0 1)) (not (= sum_~x.offset 0))))} is VALID [2018-11-23 12:18:15,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {1002#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (or (and (<= (select (select |#memory_int| sum_~x.base) 0) sum_~ret~0) (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) 0))) (<= (+ sum_~x.offset (* 4 sum_~i~0)) 3)) (<= sum_~i~0 1)) (not (= sum_~x.offset 0))))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1003#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 sum_~i~0) 3) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0))) (<= (* 4 sum_~i~0) 4)))} is VALID [2018-11-23 12:18:15,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1003#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 sum_~i~0) 3) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0))) (<= (* 4 sum_~i~0) 4)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1004#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 sum_~i~0) 8) (or (<= (* 4 sum_~i~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} is VALID [2018-11-23 12:18:15,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {1004#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 sum_~i~0) 8) (or (<= (* 4 sum_~i~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} assume !(~i~0 < ~N~0); {1005#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 ~N~0) 8) (or (<= (* 4 ~N~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} is VALID [2018-11-23 12:18:15,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {1005#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 ~N~0) 8) (or (<= (* 4 ~N~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} is VALID [2018-11-23 12:18:15,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} assume true; {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} is VALID [2018-11-23 12:18:17,832 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} {1008#(and (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (<= (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (- 2147483648))) 4294967296)) 4294967295))) (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} #66#return; {1011#(and (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (= main_~ret~1 |main_#t~ret6|) (<= (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (- 2147483648))) 4294967296)) 4294967295))) (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (= main_~ret~1 |main_#t~ret6|) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} is UNKNOWN [2018-11-23 12:18:17,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {1011#(and (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (= main_~ret~1 |main_#t~ret6|) (<= (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (- 2147483648))) 4294967296)) 4294967295))) (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) (= main_~ret~1 |main_#t~ret6|) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {1012#(and (= |main_~#x~0.offset| 0) (= main_~i~1 0) (or (<= (+ (* 4 main_~i~1) |main_~#x~0.offset| 9) (* 4 ~N~0)) (and (or (and (= main_~ret2~0 main_~ret~1) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))) 4294967296))) (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)))) (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)) 2147483648)) 4294967296)) (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))))) (and (= main_~ret2~0 main_~ret~1) (<= (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))) (+ (* 4294967296 (div (+ main_~temp~0 (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)) (- 2147483648))) 4294967296)) 4294967295)) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))) 4294967296)) 4294967296) (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)))))) (<= 8 (* 4 ~N~0)))))} is VALID [2018-11-23 12:18:17,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {1012#(and (= |main_~#x~0.offset| 0) (= main_~i~1 0) (or (<= (+ (* 4 main_~i~1) |main_~#x~0.offset| 9) (* 4 ~N~0)) (and (or (and (= main_~ret2~0 main_~ret~1) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))) 4294967296))) (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)))) (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)) 2147483648)) 4294967296)) (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))))) (and (= main_~ret2~0 main_~ret~1) (<= (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))) (+ (* 4294967296 (div (+ main_~temp~0 (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)) (- 2147483648))) 4294967296)) 4294967295)) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4))) 4294967296)) 4294967296) (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 main_~i~1) 4)))))) (<= 8 (* 4 ~N~0)))))} assume !!(~i~1 < ~N~0 - 1);call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem9, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~mem9; {1013#(and (= |main_~#x~0.offset| 0) (= main_~i~1 0) (or (and (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) 2147483648)) 4294967296)) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) main_~temp~0)) (= main_~ret2~0 main_~ret~1) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1)))) 4294967296))) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) main_~temp~0))) (<= 9 (* 4 ~N~0)) (and (<= (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1)))) 4294967296)) (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) (- 2147483648))) 4294967296))) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1)))) 4294967296)) 4294967296) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) main_~temp~0)) (= main_~ret2~0 main_~ret~1))) (<= 8 (* 4 ~N~0)))} is VALID [2018-11-23 12:18:17,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {1013#(and (= |main_~#x~0.offset| 0) (= main_~i~1 0) (or (and (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) 2147483648)) 4294967296)) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) main_~temp~0)) (= main_~ret2~0 main_~ret~1) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1)))) 4294967296))) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) main_~temp~0))) (<= 9 (* 4 ~N~0)) (and (<= (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1)))) 4294967296)) (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) (- 2147483648))) 4294967296))) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1)))) 4294967296)) 4294967296) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) (+ |main_~#x~0.offset| (* 4 main_~i~1))) main_~temp~0)) (= main_~ret2~0 main_~ret~1))) (<= 8 (* 4 ~N~0)))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {1014#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0) (or (<= (+ (* 4 main_~i~1) |main_~#x~0.offset| 5) (* 4 ~N~0)) (and (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) 2147483648)) 4294967296)) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296))) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1)) (and (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296)) 4294967296) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1) (<= (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0) (+ (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) (- 2147483648))) 4294967296)) 4294967295))) (<= 9 (* 4 ~N~0))))} is VALID [2018-11-23 12:18:17,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {1014#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0) (or (<= (+ (* 4 main_~i~1) |main_~#x~0.offset| 5) (* 4 ~N~0)) (and (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) 2147483648)) 4294967296)) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296))) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1)) (and (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296)) 4294967296) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1) (<= (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0) (+ (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) (- 2147483648))) 4294967296)) 4294967295))) (<= 9 (* 4 ~N~0))))} assume !(~i~1 < ~N~0 - 1); {1015#(and (or (and (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) 2147483648)) 4294967296)) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296))) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1)) (and (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296)) 4294967296) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1) (<= (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0) (+ (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) (- 2147483648))) 4294967296)) 4294967295))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} is VALID [2018-11-23 12:18:17,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {1015#(and (or (and (<= (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) 2147483648)) 4294967296)) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296))) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1)) (and (= (+ main_~ret~1 (* 4294967296 (div (+ main_~temp~0 (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0)) 4294967296)) 4294967296) (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0)) (= main_~ret2~0 main_~ret~1) (<= (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) main_~temp~0) (+ (* 4294967296 (div (+ main_~temp~0 (+ (select (store (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)) main_~temp~0) 0) (- 2147483648))) 4294967296)) 4294967295))) (<= 9 (* 4 ~N~0))) (= |main_~#x~0.offset| 0) (<= 8 (* 4 ~N~0)))} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {1016#(and (= |main_~#x~0.offset| 0) (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))))) (= main_~ret2~0 main_~ret~1) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (- 2147483648))) 4294967296)))) (and (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))))) (= main_~ret2~0 main_~ret~1) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)))))) (<= 9 (* 4 ~N~0))) (<= 8 (* 4 ~N~0)))} is VALID [2018-11-23 12:18:17,985 INFO L256 TraceCheckUtils]: 33: Hoare triple {1016#(and (= |main_~#x~0.offset| 0) (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))))) (= main_~ret2~0 main_~ret~1) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (- 2147483648))) 4294967296)))) (and (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))))) (= main_~ret2~0 main_~ret~1) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)))))) (<= 9 (* 4 ~N~0))) (<= 8 (* 4 ~N~0)))} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {997#true} is VALID [2018-11-23 12:18:17,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {997#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1009#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (= sum_~x.base |sum_#in~x.base|) (not (= sum_~x.offset 0))) (= sum_~ret~0 0) (= sum_~i~0 0))} is VALID [2018-11-23 12:18:17,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {1009#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (= sum_~x.base |sum_#in~x.base|) (not (= sum_~x.offset 0))) (= sum_~ret~0 0) (= sum_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1010#(and (or (and (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0)))) (<= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0)) (not (= sum_~x.offset 0))) (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (= sum_~i~0 0))} is VALID [2018-11-23 12:18:17,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {1010#(and (or (and (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0)))) (<= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0)) (not (= sum_~x.offset 0))) (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (= sum_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1002#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (or (and (<= (select (select |#memory_int| sum_~x.base) 0) sum_~ret~0) (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) 0))) (<= (+ sum_~x.offset (* 4 sum_~i~0)) 3)) (<= sum_~i~0 1)) (not (= sum_~x.offset 0))))} is VALID [2018-11-23 12:18:17,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {1002#(and (or (= |sum_#in~x.offset| sum_~x.offset) (= sum_~x.offset 0)) (or (and (or (and (<= (select (select |#memory_int| sum_~x.base) 0) sum_~ret~0) (= sum_~x.base |sum_#in~x.base|) (<= sum_~ret~0 (select (select |#memory_int| sum_~x.base) 0))) (<= (+ sum_~x.offset (* 4 sum_~i~0)) 3)) (<= sum_~i~0 1)) (not (= sum_~x.offset 0))))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1003#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 sum_~i~0) 3) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0))) (<= (* 4 sum_~i~0) 4)))} is VALID [2018-11-23 12:18:17,989 INFO L273 TraceCheckUtils]: 38: Hoare triple {1003#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 sum_~i~0) 3) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) (+ (* (- 4) sum_~i~0) 4))) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0))) (<= (* 4 sum_~i~0) 4)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1004#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 sum_~i~0) 8) (or (<= (* 4 sum_~i~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} is VALID [2018-11-23 12:18:17,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {1004#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 sum_~i~0) 8) (or (<= (* 4 sum_~i~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} assume !(~i~0 < ~N~0); {1005#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 ~N~0) 8) (or (<= (* 4 ~N~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} is VALID [2018-11-23 12:18:17,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {1005#(or (not (= |sum_#in~x.offset| 0)) (and (<= (* 4 ~N~0) 8) (or (<= (* 4 ~N~0) 7) (and (<= sum_~ret~0 (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0))) (<= (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)) sum_~ret~0)))))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} is VALID [2018-11-23 12:18:17,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} assume true; {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} is VALID [2018-11-23 12:18:18,000 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1006#(or (not (= |sum_#in~x.offset| 0)) (and (or (<= (* 4 ~N~0) 7) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |sum_#in~x.base|) 0) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (- 2147483648))) 4294967296)) |sum_#res| 4294967296) (+ (select (select |#memory_int| |sum_#in~x.base|) 4) (select (select |#memory_int| |sum_#in~x.base|) 0)))) (<= (* 4 ~N~0) 8)))} {1016#(and (= |main_~#x~0.offset| 0) (or (and (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) main_~ret~1 4294967296) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))))) (= main_~ret2~0 main_~ret~1) (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (- 2147483648))) 4294967296)))) (and (<= (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) 2147483648)) 4294967296)) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))))) (= main_~ret2~0 main_~ret~1) (= (+ (* 4294967296 (div (+ (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4))) (select (select |#memory_int| |main_~#x~0.base|) 0)) 4294967296)) main_~ret~1) (+ (select (select |#memory_int| |main_~#x~0.base|) 0) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| (* 4 ~N~0) (- 4)))))) (<= 9 (* 4 ~N~0))) (<= 8 (* 4 ~N~0)))} #68#return; {1017#(and (= main_~ret~1 |main_#t~ret10|) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:18:18,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {1017#(and (= main_~ret~1 |main_#t~ret10|) (= main_~ret2~0 main_~ret~1))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {1018#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:18:18,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {1018#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {998#false} is VALID [2018-11-23 12:18:18,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {998#false} assume !false; {998#false} is VALID [2018-11-23 12:18:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:18:18,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:18,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:18,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:23,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2018-11-23 12:18:23,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:23,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-11-23 12:18:23,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:23,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-23 12:18:23,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:23,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:23,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:25,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2018-11-23 12:18:25,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:25,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 12:18:25,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:25,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-23 12:18:25,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:25,405 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:25,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:29,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:18:29,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:143, output treesize:91 [2018-11-23 12:18:31,609 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 12:18:32,331 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-23 12:18:36,595 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-23 12:18:36,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 66 [2018-11-23 12:18:36,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:36,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-11-23 12:18:36,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:36,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:41,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 70 [2018-11-23 12:18:41,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:41,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-11-23 12:18:41,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:41,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:41,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:18:41,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:383, output treesize:129 [2018-11-23 12:18:41,304 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:18:41,305 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_3, |v_#memory_int_13|, v_prenex_5, v_prenex_4]. (let ((.cse0 (<= ~N~0 2)) (.cse3 (+ main_~ret2~0 4294967296)) (.cse1 (<= 2 ~N~0)) (.cse14 (+ main_~ret~1 4294967296)) (.cse5 (= |main_~#x~0.offset| 0)) (.cse8 (+ |main_~#x~0.offset| 4))) (or (let ((.cse6 (select v_prenex_3 |main_~#x~0.base|))) (let ((.cse7 (select .cse6 .cse8)) (.cse4 (select .cse6 |main_~#x~0.offset|))) (let ((.cse2 (mod (+ .cse7 .cse4) 4294967296))) (and .cse0 .cse1 (<= .cse2 2147483647) (= .cse3 .cse2) (< 2147483647 .cse2) (= main_~temp~0 .cse4) .cse5 (= (store v_prenex_3 |main_~#x~0.base| (store .cse6 |main_~#x~0.offset| .cse7)) |#memory_int|) (= .cse2 main_~ret~1))))) (let ((.cse11 (select |v_#memory_int_13| |main_~#x~0.base|))) (let ((.cse12 (select .cse11 .cse8)) (.cse9 (select .cse11 |main_~#x~0.offset|))) (let ((.cse10 (mod (+ .cse12 .cse9) 4294967296))) (and .cse0 (= main_~temp~0 .cse9) .cse1 (<= .cse10 2147483647) (= (store |v_#memory_int_13| |main_~#x~0.base| (store .cse11 |main_~#x~0.offset| .cse12)) |#memory_int|) (= .cse10 main_~ret2~0) .cse5 (= .cse10 main_~ret~1))))) (let ((.cse15 (select v_prenex_5 |main_~#x~0.base|))) (let ((.cse16 (select .cse15 .cse8)) (.cse17 (select .cse15 |main_~#x~0.offset|))) (let ((.cse13 (mod (+ .cse16 .cse17) 4294967296))) (and .cse0 (= .cse13 main_~ret2~0) .cse1 (= .cse13 .cse14) (< 2147483647 .cse13) (= (store v_prenex_5 |main_~#x~0.base| (store .cse15 |main_~#x~0.offset| .cse16)) |#memory_int|) (= main_~temp~0 .cse17) (<= .cse13 2147483647) .cse5)))) (let ((.cse20 (select v_prenex_4 |main_~#x~0.base|))) (let ((.cse21 (select .cse20 .cse8)) (.cse19 (select .cse20 |main_~#x~0.offset|))) (let ((.cse18 (mod (+ .cse21 .cse19) 4294967296))) (and .cse0 (= .cse3 .cse18) .cse1 (= main_~temp~0 .cse19) (= .cse18 .cse14) (< 2147483647 .cse18) .cse5 (= (store v_prenex_4 |main_~#x~0.base| (store .cse20 |main_~#x~0.offset| .cse21)) |#memory_int|))))))) [2018-11-23 12:18:41,305 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse5 (select .cse6 (+ |main_~#x~0.offset| 4)))) (let ((.cse0 (<= ~N~0 2)) (.cse1 (<= 2 ~N~0)) (.cse3 (= .cse5 (select .cse6 |main_~#x~0.offset|))) (.cse2 (mod (+ main_~temp~0 .cse5) 4294967296)) (.cse4 (= |main_~#x~0.offset| 0))) (or (and .cse0 .cse1 (= main_~ret~1 .cse2) (<= .cse2 2147483647) .cse3 (= main_~ret2~0 .cse2) .cse4) (and .cse0 .cse1 (= (+ main_~ret2~0 4294967296) .cse2) (< 2147483647 .cse2) .cse3 (= (+ main_~ret~1 4294967296) .cse2) .cse4))))) [2018-11-23 12:18:41,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 65 [2018-11-23 12:18:41,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:41,997 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:18:42,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-11-23 12:18:42,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:42,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:42,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 69 [2018-11-23 12:18:42,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:42,122 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:18:42,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 12:18:42,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:42,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:44,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:18:44,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:161, output treesize:115 [2018-11-23 12:18:44,262 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:18:44,263 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, ~N~0, main_~temp~0, v_prenex_8, v_prenex_6, v_prenex_7]. (let ((.cse3 (= |main_~#x~0.offset| 0)) (.cse4 (+ |main_~#x~0.offset| 4))) (or (let ((.cse1 (select |v_#memory_int_14| |main_~#x~0.base|))) (let ((.cse2 (select .cse1 .cse4))) (let ((.cse0 (mod (+ main_~temp~0 .cse2) 4294967296))) (and (<= ~N~0 2) (< 2147483647 .cse0) (= (select .cse1 |main_~#x~0.offset|) .cse2) (<= 2 ~N~0) (= (+ main_~ret~1 4294967296) .cse0) (= (+ main_~ret2~0 4294967296) .cse0) .cse3 (= (store |v_#memory_int_14| |main_~#x~0.base| (store .cse1 (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)) main_~temp~0)) |#memory_int|))))) (let ((.cse5 (select v_prenex_8 |main_~#x~0.base|))) (let ((.cse7 (select .cse5 .cse4))) (let ((.cse6 (mod (+ v_prenex_7 .cse7) 4294967296))) (and (<= 2 v_prenex_6) (= (store v_prenex_8 |main_~#x~0.base| (store .cse5 (+ (* 4 v_prenex_6) |main_~#x~0.offset| (- 4)) v_prenex_7)) |#memory_int|) (= main_~ret~1 .cse6) (= (select .cse5 |main_~#x~0.offset|) .cse7) (= main_~ret2~0 .cse6) .cse3 (<= .cse6 2147483647) (<= v_prenex_6 2))))))) [2018-11-23 12:18:44,263 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (= |main_~#x~0.offset| 0)) (.cse0 (mod (let ((.cse2 (select |#memory_int| |main_~#x~0.base|))) (+ (select .cse2 |main_~#x~0.offset|) (select .cse2 (+ |main_~#x~0.offset| 4)))) 4294967296))) (or (and (= main_~ret~1 .cse0) .cse1 (= main_~ret2~0 .cse0) (<= .cse0 2147483647)) (and (= (+ main_~ret~1 4294967296) .cse0) .cse1 (= (+ main_~ret2~0 4294967296) .cse0) (< 2147483647 .cse0)))) [2018-11-23 12:18:46,358 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 12:18:46,890 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:18:46,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:46,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2018-11-23 12:18:46,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2018-11-23 12:18:46,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:18:46,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:18:47,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2018-11-23 12:18:47,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2018-11-23 12:18:47,014 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:18:47,024 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:18:47,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 12:18:47,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:287, output treesize:65 [2018-11-23 12:18:47,084 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:18:47,085 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_11, v_prenex_10, v_prenex_15, v_prenex_14, |#memory_int|, |main_~#x~0.base|, v_prenex_13, v_prenex_12]. (let ((.cse2 (+ main_~ret2~0 4294967296)) (.cse1 (+ main_~ret~1 4294967296)) (.cse3 (+ |main_#t~ret10| 4294967296))) (or (let ((.cse0 (mod (let ((.cse4 (select v_prenex_11 v_prenex_10))) (+ (select .cse4 0) (select .cse4 4))) 4294967296))) (and (< 2147483647 .cse0) (= .cse1 .cse0) (= .cse2 .cse0) (= .cse3 .cse0))) (let ((.cse5 (mod (let ((.cse6 (select v_prenex_15 v_prenex_14))) (+ (select .cse6 0) (select .cse6 4))) 4294967296))) (and (= |main_#t~ret10| .cse5) (<= .cse5 2147483647) (= main_~ret~1 .cse5) (= main_~ret2~0 .cse5))) (let ((.cse7 (mod (let ((.cse8 (select |#memory_int| |main_~#x~0.base|))) (+ (select .cse8 0) (select .cse8 4))) 4294967296))) (and (= |main_#t~ret10| .cse7) (= .cse2 .cse7) (<= .cse7 2147483647) (= .cse1 .cse7) (< 2147483647 .cse7))) (let ((.cse9 (mod (let ((.cse10 (select v_prenex_13 v_prenex_12))) (+ (select .cse10 0) (select .cse10 4))) 4294967296))) (and (= main_~ret~1 .cse9) (= .cse3 .cse9) (= main_~ret2~0 .cse9) (<= .cse9 2147483647) (< 2147483647 .cse9))))) [2018-11-23 12:18:47,085 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_14, v_arrayElimCell_15, v_arrayElimCell_18, v_arrayElimCell_17]. (or (let ((.cse0 (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296))) (and (= (+ main_~ret2~0 4294967296) .cse0) (= .cse0 (+ main_~ret~1 4294967296)) (= .cse0 (+ |main_#t~ret10| 4294967296)) (< 2147483647 .cse0))) (let ((.cse1 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296))) (and (= |main_#t~ret10| .cse1) (= main_~ret~1 .cse1) (<= .cse1 2147483647) (= main_~ret2~0 .cse1)))) [2018-11-23 12:19:08,627 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 12:19:08,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {997#true} is VALID [2018-11-23 12:19:08,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {997#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {997#true} is VALID [2018-11-23 12:19:08,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 12:19:08,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {997#true} {997#true} #60#return; {997#true} is VALID [2018-11-23 12:19:08,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {997#true} call #t~ret11 := main(); {997#true} is VALID [2018-11-23 12:19:08,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {997#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {997#true} is VALID [2018-11-23 12:19:08,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {997#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {999#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0))} is VALID [2018-11-23 12:19:08,947 INFO L256 TraceCheckUtils]: 7: Hoare triple {999#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {1043#(<= 2 ~N~0)} is VALID [2018-11-23 12:19:08,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {1043#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1047#(and (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= 0 sum_~ret~0) (= sum_~i~0 0))} is VALID [2018-11-23 12:19:08,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#(and (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= 0 sum_~ret~0) (= sum_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1051#(and (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0))} is VALID [2018-11-23 12:19:08,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {1051#(and (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1055#(and (= sum_~ret~0 (select (select |#memory_int| sum_~x.base) sum_~x.offset)) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= sum_~i~0 1))} is VALID [2018-11-23 12:19:08,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(and (= sum_~ret~0 (select (select |#memory_int| sum_~x.base) sum_~x.offset)) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= sum_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1059#(and (= (+ (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|) (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) |sum_#in~x.offset|))) sum_~ret~0) (<= 2 ~N~0) (= sum_~i~0 1))} is VALID [2018-11-23 12:19:08,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {1059#(and (= (+ (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|) (select (select |#memory_int| |sum_#in~x.base|) (+ (* 4 sum_~i~0) |sum_#in~x.offset|))) sum_~ret~0) (<= 2 ~N~0) (= sum_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1063#(and (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0) (<= sum_~i~0 2))} is VALID [2018-11-23 12:19:08,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(and (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0) (<= sum_~i~0 2))} assume !(~i~0 < ~N~0); {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} is VALID [2018-11-23 12:19:08,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} is VALID [2018-11-23 12:19:08,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} assume true; {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} is VALID [2018-11-23 12:19:10,968 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} {999#(and (<= 2 ~N~0) (= |main_~#x~0.offset| 0))} #64#return; {1078#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) |main_#t~ret3|) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) (+ |main_#t~ret3| 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (= |main_~#x~0.offset| 0))} is UNKNOWN [2018-11-23 12:19:12,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {1078#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) |main_#t~ret3|) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) (+ |main_#t~ret3| 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (= |main_~#x~0.offset| 0))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1082#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296))))} is UNKNOWN [2018-11-23 12:19:12,978 INFO L256 TraceCheckUtils]: 18: Hoare triple {1082#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296))))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {1086#(and (<= ~N~0 2) (<= 2 ~N~0))} is VALID [2018-11-23 12:19:12,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {1086#(and (<= ~N~0 2) (<= 2 ~N~0))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1090#(and (<= ~N~0 2) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= 0 sum_~ret~0) (= sum_~i~0 0))} is VALID [2018-11-23 12:19:12,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#(and (<= ~N~0 2) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= 0 sum_~ret~0) (= sum_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1094#(and (<= ~N~0 2) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0))} is VALID [2018-11-23 12:19:12,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {1094#(and (<= ~N~0 2) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1098#(and (<= ~N~0 2) (= sum_~ret~0 (select (select |#memory_int| sum_~x.base) sum_~x.offset)) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= sum_~i~0 1))} is VALID [2018-11-23 12:19:12,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#(and (<= ~N~0 2) (= sum_~ret~0 (select (select |#memory_int| sum_~x.base) sum_~x.offset)) (= sum_~x.offset |sum_#in~x.offset|) (<= 2 ~N~0) (= |sum_#in~x.base| sum_~x.base) (= sum_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} is VALID [2018-11-23 12:19:12,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} is VALID [2018-11-23 12:19:12,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} assume !(~i~0 < ~N~0); {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} is VALID [2018-11-23 12:19:12,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {1067#(and (<= ~N~0 2) (<= 2 ~N~0) (= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} is VALID [2018-11-23 12:19:12,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} assume true; {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} is VALID [2018-11-23 12:19:12,994 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1071#(and (<= ~N~0 2) (<= 2 ~N~0) (or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)))))} {1082#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296))))} #66#return; {1117#(and (<= 2 ~N~0) (or (and (= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) |main_#t~ret6|) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (+ |main_#t~ret6| 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (or (and (<= ~N~0 2) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))))} is VALID [2018-11-23 12:19:12,996 INFO L273 TraceCheckUtils]: 28: Hoare triple {1117#(and (<= 2 ~N~0) (or (and (= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) |main_#t~ret6|) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (+ |main_#t~ret6| 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (or (and (<= ~N~0 2) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {1121#(and (or (and (= main_~ret2~0 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (+ main_~ret2~0 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (<= 2 ~N~0) (or (and (<= ~N~0 2) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~i~1 0))} is VALID [2018-11-23 12:19:13,000 INFO L273 TraceCheckUtils]: 29: Hoare triple {1121#(and (or (and (= main_~ret2~0 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (+ main_~ret2~0 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (<= 2 ~N~0) (or (and (<= ~N~0 2) (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (<= ~N~0 2) (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~i~1 0))} assume !!(~i~1 < ~N~0 - 1);call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem9, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~mem9; {1125#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret2~0 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret2~0 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (+ main_~ret~1 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)))} is VALID [2018-11-23 12:19:13,000 INFO L273 TraceCheckUtils]: 30: Hoare triple {1125#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret2~0 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret2~0 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (+ main_~ret~1 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {1125#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret2~0 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret2~0 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (+ main_~ret~1 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)))} is VALID [2018-11-23 12:19:13,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {1125#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret2~0 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret2~0 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (+ main_~ret~1 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)))} assume !(~i~1 < ~N~0 - 1); {1125#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret2~0 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret2~0 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (+ main_~ret~1 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)))} is VALID [2018-11-23 12:19:13,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {1125#(or (and (<= ~N~0 2) (<= 2 ~N~0) (= main_~ret~1 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret2~0 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)) (and (<= ~N~0 2) (<= 2 ~N~0) (= (+ main_~ret2~0 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (< 2147483647 (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (+ main_~ret~1 4294967296) (mod (+ main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0)))} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {1135#(or (and (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (= main_~ret2~0 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (+ main_~ret2~0 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296))))} is VALID [2018-11-23 12:19:13,019 INFO L256 TraceCheckUtils]: 33: Hoare triple {1135#(or (and (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (= main_~ret2~0 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (+ main_~ret2~0 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296))))} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {997#true} is VALID [2018-11-23 12:19:13,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {997#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1142#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= 0 sum_~ret~0) (= sum_~i~0 0))} is VALID [2018-11-23 12:19:13,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {1142#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= 0 sum_~ret~0) (= sum_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1146#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0))} is VALID [2018-11-23 12:19:13,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {1146#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (select (select |#memory_int| sum_~x.base) (+ sum_~x.offset (* 4 sum_~i~0))) sum_~ret~0) (= sum_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1150#(and (= sum_~ret~0 (select (select |#memory_int| sum_~x.base) sum_~x.offset)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= sum_~i~0 1))} is VALID [2018-11-23 12:19:13,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {1150#(and (= sum_~ret~0 (select (select |#memory_int| sum_~x.base) sum_~x.offset)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= sum_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1154#(= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0)} is VALID [2018-11-23 12:19:13,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {1154#(= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1154#(= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0)} is VALID [2018-11-23 12:19:13,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {1154#(= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0)} assume !(~i~0 < ~N~0); {1154#(= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0)} is VALID [2018-11-23 12:19:13,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {1154#(= (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) sum_~ret~0)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1164#(or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))))} is VALID [2018-11-23 12:19:13,044 INFO L273 TraceCheckUtils]: 41: Hoare triple {1164#(or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))))} assume true; {1164#(or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))))} is VALID [2018-11-23 12:19:13,047 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1164#(or (and (= (+ |sum_#res| 4294967296) (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296)) (< 2147483647 (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))) (and (<= (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296) 2147483647) (= |sum_#res| (mod (+ (select (select |#memory_int| |sum_#in~x.base|) (+ |sum_#in~x.offset| 4)) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)) 4294967296))))} {1135#(or (and (= main_~ret~1 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (= main_~ret2~0 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (<= (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296) 2147483647)) (and (= (+ main_~ret~1 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= (+ main_~ret2~0 4294967296) (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296)) (= |main_~#x~0.offset| 0) (< 2147483647 (mod (+ (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) 4294967296))))} #68#return; {1171#(or (exists ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int)) (and (= |main_#t~ret10| (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (= main_~ret~1 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (<= (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296) 2147483647) (= main_~ret2~0 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)))) (exists ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (and (= (+ main_~ret2~0 4294967296) (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ main_~ret~1 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ |main_#t~ret10| 4294967296)) (< 2147483647 (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)))))} is VALID [2018-11-23 12:19:13,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {1171#(or (exists ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int)) (and (= |main_#t~ret10| (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (= main_~ret~1 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (<= (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296) 2147483647) (= main_~ret2~0 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)))) (exists ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (and (= (+ main_~ret2~0 4294967296) (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ main_~ret~1 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ |main_#t~ret10| 4294967296)) (< 2147483647 (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)))))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {1175#(or (exists ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int)) (and (= main_~ret~1 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (<= (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296) 2147483647) (= main_~ret2~0 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (= main_~ret5~0 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)))) (exists ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (and (= (+ main_~ret2~0 4294967296) (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ main_~ret~1 4294967296)) (< 2147483647 (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ main_~ret5~0 4294967296)))))} is VALID [2018-11-23 12:19:13,051 INFO L273 TraceCheckUtils]: 44: Hoare triple {1175#(or (exists ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int)) (and (= main_~ret~1 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (<= (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296) 2147483647) (= main_~ret2~0 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)) (= main_~ret5~0 (mod (+ v_arrayElimCell_18 v_arrayElimCell_17) 4294967296)))) (exists ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (and (= (+ main_~ret2~0 4294967296) (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ main_~ret~1 4294967296)) (< 2147483647 (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296)) (= (mod (+ v_arrayElimCell_14 v_arrayElimCell_15) 4294967296) (+ main_~ret5~0 4294967296)))))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {998#false} is VALID [2018-11-23 12:19:13,051 INFO L273 TraceCheckUtils]: 45: Hoare triple {998#false} assume !false; {998#false} is VALID [2018-11-23 12:19:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:19:13,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 47 [2018-11-23 12:19:13,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-11-23 12:19:13,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:13,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:19:15,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 68 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:15,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:19:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:19:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1923, Unknown=9, NotChecked=0, Total=2162 [2018-11-23 12:19:15,299 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 47 states. [2018-11-23 12:19:52,228 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2018-11-23 12:20:15,107 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2018-11-23 12:20:33,013 WARN L180 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 94 DAG size of output: 58