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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:51:06,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:51:06,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:51:06,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:51:06,861 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:51:06,862 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:51:06,863 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:51:06,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:51:06,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:51:06,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:51:06,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:51:06,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:51:06,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:51:06,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:51:06,880 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:51:06,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:51:06,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:51:06,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:51:06,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:51:06,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:51:06,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:51:06,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:51:06,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:51:06,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:51:06,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:51:06,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:51:06,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:51:06,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:51:06,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:51:06,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:51:06,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:51:06,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:51:06,899 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:51:06,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:51:06,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:51:06,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:51:06,901 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:51:06,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:51:06,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:51:06,917 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:51:06,917 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:51:06,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:51:06,918 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:51:06,918 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:51:06,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:51:06,919 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:51:06,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:51:06,919 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:51:06,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:51:06,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:51:06,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:51:06,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:51:06,920 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:51:06,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:51:06,921 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:51:06,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:51:06,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:51:06,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:51:06,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:51:06,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:51:06,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:51:06,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:51:06,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:51:06,922 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:51:06,923 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:51:06,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:51:06,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:51:06,923 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:51:06,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:51:06,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:51:06,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:51:06,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:51:06,988 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:51:06,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-14 18:51:07,042 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb1df0af/bdf1127e2cc54337bbd505e91d70d224/FLAG09e7a0258 [2018-11-14 18:51:07,498 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:51:07,499 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-14 18:51:07,506 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb1df0af/bdf1127e2cc54337bbd505e91d70d224/FLAG09e7a0258 [2018-11-14 18:51:07,521 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb1df0af/bdf1127e2cc54337bbd505e91d70d224 [2018-11-14 18:51:07,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:51:07,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:51:07,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:51:07,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:51:07,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:51:07,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9be5850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07, skipping insertion in model container [2018-11-14 18:51:07,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:51:07,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:51:07,806 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:51:07,818 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:51:07,845 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:51:07,863 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:51:07,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07 WrapperNode [2018-11-14 18:51:07,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:51:07,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:51:07,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:51:07,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:51:07,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (1/1) ... [2018-11-14 18:51:07,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:51:07,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:51:07,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:51:07,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:51:07,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (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-14 18:51:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:51:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:51:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-14 18:51:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:51:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:51:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:51:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-14 18:51:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:51:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:51:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:51:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:51:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:51:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:51:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:51:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:51:08,756 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:51:08,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:51:08 BoogieIcfgContainer [2018-11-14 18:51:08,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:51:08,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:51:08,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:51:08,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:51:08,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:51:07" (1/3) ... [2018-11-14 18:51:08,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb36b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:51:08, skipping insertion in model container [2018-11-14 18:51:08,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:07" (2/3) ... [2018-11-14 18:51:08,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb36b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:51:08, skipping insertion in model container [2018-11-14 18:51:08,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:51:08" (3/3) ... [2018-11-14 18:51:08,768 INFO L112 eAbstractionObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2018-11-14 18:51:08,779 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:51:08,786 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:51:08,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:51:08,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:51:08,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:51:08,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:51:08,846 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:51:08,846 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:51:08,846 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:51:08,846 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:51:08,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:51:08,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:51:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 18:51:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:51:08,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:08,882 INFO L375 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-14 18:51:08,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:08,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1575634353, now seen corresponding path program 1 times [2018-11-14 18:51:08,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:08,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:08,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:08,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:09,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 18:51:09,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 18:51:09,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:51:09,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 18:51:09,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret12 := main(); {37#true} is VALID [2018-11-14 18:51:09,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37#true} is VALID [2018-11-14 18:51:09,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 18:51:09,154 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:51:09,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {37#true} is VALID [2018-11-14 18:51:09,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:51:09,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:51:09,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:51:09,156 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 18:51:09,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {38#false} is VALID [2018-11-14 18:51:09,159 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:51:09,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {37#true} is VALID [2018-11-14 18:51:09,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:51:09,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:51:09,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:51:09,161 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 18:51:09,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {38#false} is VALID [2018-11-14 18:51:09,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 18:51:09,163 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {38#false} is VALID [2018-11-14 18:51:09,164 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:51:09,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {37#true} is VALID [2018-11-14 18:51:09,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:51:09,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:51:09,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:51:09,167 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 18:51:09,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {38#false} is VALID [2018-11-14 18:51:09,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {38#false} is VALID [2018-11-14 18:51:09,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 18:51:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:51:09,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:51:09,195 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:51:09,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:09,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:51:09,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:09,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:51:09,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:51:09,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:51:09,388 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 18:51:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:09,540 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 18:51:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:51:09,541 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:51:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:51:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:51:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:51:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:51:09,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 18:51:09,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:09,854 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:51:09,855 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 18:51:09,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-14 18:51:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 18:51:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 18:51:10,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:10,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 18:51:10,046 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 18:51:10,046 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 18:51:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:10,052 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 18:51:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:51:10,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:10,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:10,054 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 18:51:10,054 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 18:51:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:10,061 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 18:51:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:51:10,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:10,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:10,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:10,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:51:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 18:51:10,074 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 18:51:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:10,075 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 18:51:10,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:51:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:51:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:51:10,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:10,079 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:10,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:10,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1963798480, now seen corresponding path program 1 times [2018-11-14 18:51:10,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:10,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:10,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:10,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:10,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 18:51:10,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-14 18:51:10,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 18:51:10,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret12 := main(); {215#true} is VALID [2018-11-14 18:51:10,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {217#(= main_~i~1 0)} is VALID [2018-11-14 18:51:10,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 18:51:10,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 5); {216#false} is VALID [2018-11-14 18:51:10,218 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:51:10,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {215#true} is VALID [2018-11-14 18:51:10,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 5); {215#true} is VALID [2018-11-14 18:51:10,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:51:10,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,220 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 18:51:10,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {216#false} is VALID [2018-11-14 18:51:10,221 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:51:10,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {215#true} is VALID [2018-11-14 18:51:10,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 5); {215#true} is VALID [2018-11-14 18:51:10,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {215#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:51:10,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,223 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 18:51:10,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {216#false} is VALID [2018-11-14 18:51:10,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 18:51:10,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 4); {216#false} is VALID [2018-11-14 18:51:10,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {216#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {216#false} is VALID [2018-11-14 18:51:10,224 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:51:10,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {215#true} is VALID [2018-11-14 18:51:10,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 5); {215#true} is VALID [2018-11-14 18:51:10,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {215#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:51:10,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:51:10,226 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 18:51:10,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {216#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {216#false} is VALID [2018-11-14 18:51:10,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {216#false} is VALID [2018-11-14 18:51:10,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 18:51:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:51:10,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:10,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:51:10,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 18:51:10,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:10,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:51:10,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:10,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:51:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:51:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:51:10,453 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 18:51:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:10,937 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 18:51:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:51:10,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 18:51:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:51:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:51:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:51:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:51:10,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 18:51:11,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:11,099 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:51:11,100 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:51:11,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:51:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:51:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 18:51:11,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:11,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 18:51:11,129 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 18:51:11,130 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 18:51:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:11,135 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 18:51:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:51:11,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:11,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:11,136 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 18:51:11,136 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 18:51:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:11,140 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 18:51:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:51:11,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:11,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:11,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:11,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:51:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 18:51:11,144 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 18:51:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:11,145 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 18:51:11,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:51:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:51:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:51:11,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:11,147 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:11,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:11,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -600213610, now seen corresponding path program 1 times [2018-11-14 18:51:11,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:11,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:11,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 18:51:11,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 18:51:11,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 18:51:11,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret12 := main(); {397#true} is VALID [2018-11-14 18:51:11,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 18:51:11,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {397#true} is VALID [2018-11-14 18:51:11,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {397#true} is VALID [2018-11-14 18:51:11,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 5); {397#true} is VALID [2018-11-14 18:51:11,248 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:51:11,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {399#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:11,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= sum_~i~0 0)} assume true; {399#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:11,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= sum_~i~0 0)} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 18:51:11,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:51:11,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,255 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 18:51:11,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 18:51:11,256 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:51:11,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {397#true} is VALID [2018-11-14 18:51:11,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 5); {397#true} is VALID [2018-11-14 18:51:11,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {397#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 18:51:11,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,258 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 18:51:11,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {398#false} is VALID [2018-11-14 18:51:11,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 4); {398#false} is VALID [2018-11-14 18:51:11,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {398#false} is VALID [2018-11-14 18:51:11,259 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:51:11,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {397#true} is VALID [2018-11-14 18:51:11,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 5); {397#true} is VALID [2018-11-14 18:51:11,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {397#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 18:51:11,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,261 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 18:51:11,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {398#false} is VALID [2018-11-14 18:51:11,262 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {398#false} is VALID [2018-11-14 18:51:11,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 18:51:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:51:11,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:11,266 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-14 18:51:11,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:11,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:11,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 18:51:11,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 18:51:11,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 18:51:11,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret12 := main(); {397#true} is VALID [2018-11-14 18:51:11,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 18:51:11,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {397#true} is VALID [2018-11-14 18:51:11,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {397#true} is VALID [2018-11-14 18:51:11,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:51:11,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 5); {397#true} is VALID [2018-11-14 18:51:11,510 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:51:11,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {439#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:11,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= sum_~i~0 0)} assume true; {439#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:11,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= sum_~i~0 0)} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 18:51:11,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:51:11,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,528 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 18:51:11,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 18:51:11,528 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 18:51:11,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {398#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {398#false} is VALID [2018-11-14 18:51:11,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 18:51:11,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:51:11,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,530 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 18:51:11,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {398#false} is VALID [2018-11-14 18:51:11,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 4); {398#false} is VALID [2018-11-14 18:51:11,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {398#false} is VALID [2018-11-14 18:51:11,532 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 18:51:11,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {398#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {398#false} is VALID [2018-11-14 18:51:11,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 18:51:11,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {398#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:51:11,533 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:51:11,533 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 18:51:11,534 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {398#false} is VALID [2018-11-14 18:51:11,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {398#false} is VALID [2018-11-14 18:51:11,534 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 18:51:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 18:51:11,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:51:11,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 18:51:11,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:51:11,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:11,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:51:11,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:11,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:51:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:51:11,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:51:11,793 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 18:51:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:12,051 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 18:51:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:51:12,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:51:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:51:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:51:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:51:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:51:12,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 18:51:12,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:12,174 INFO L225 Difference]: With dead ends: 53 [2018-11-14 18:51:12,174 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:51:12,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-14 18:51:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:51:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 18:51:12,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:12,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 18:51:12,195 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 18:51:12,195 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 18:51:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:12,198 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:51:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:51:12,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:12,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:12,199 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 18:51:12,199 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 18:51:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:12,202 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:51:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:51:12,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:12,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:12,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:12,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:51:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 18:51:12,207 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 18:51:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:12,207 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 18:51:12,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:51:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:51:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:51:12,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:12,209 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:12,209 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:12,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1851573025, now seen corresponding path program 1 times [2018-11-14 18:51:12,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:12,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:12,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 18:51:12,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {705#true} is VALID [2018-11-14 18:51:12,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 18:51:12,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret12 := main(); {705#true} is VALID [2018-11-14 18:51:12,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {705#true} is VALID [2018-11-14 18:51:12,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {705#true} is VALID [2018-11-14 18:51:12,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {705#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {705#true} is VALID [2018-11-14 18:51:12,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 5); {705#true} is VALID [2018-11-14 18:51:12,316 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:51:12,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {705#true} is VALID [2018-11-14 18:51:12,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {705#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {705#true} is VALID [2018-11-14 18:51:12,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {705#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {705#true} is VALID [2018-11-14 18:51:12,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 5); {705#true} is VALID [2018-11-14 18:51:12,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:51:12,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,318 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 18:51:12,318 INFO L273 TraceCheckUtils]: 21: Hoare triple {705#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {705#true} is VALID [2018-11-14 18:51:12,319 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:51:12,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {705#true} is VALID [2018-11-14 18:51:12,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {705#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {705#true} is VALID [2018-11-14 18:51:12,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {705#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {705#true} is VALID [2018-11-14 18:51:12,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 5); {705#true} is VALID [2018-11-14 18:51:12,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {705#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:51:12,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,321 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 18:51:12,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {705#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {707#(= main_~i~2 0)} is VALID [2018-11-14 18:51:12,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 18:51:12,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 4); {706#false} is VALID [2018-11-14 18:51:12,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {706#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {706#false} is VALID [2018-11-14 18:51:12,324 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:51:12,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {705#true} is VALID [2018-11-14 18:51:12,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {705#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {705#true} is VALID [2018-11-14 18:51:12,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {705#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {705#true} is VALID [2018-11-14 18:51:12,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 5); {705#true} is VALID [2018-11-14 18:51:12,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {705#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:51:12,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:51:12,326 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 18:51:12,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {706#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {706#false} is VALID [2018-11-14 18:51:12,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {706#false} is VALID [2018-11-14 18:51:12,327 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 18:51:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:51:12,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:12,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:51:12,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 18:51:12,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:12,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:51:12,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:12,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:51:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:51:12,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:51:12,401 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 18:51:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:12,493 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:51:12,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:51:12,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 18:51:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:51:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:51:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:51:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:51:12,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 18:51:12,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:12,636 INFO L225 Difference]: With dead ends: 51 [2018-11-14 18:51:12,637 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 18:51:12,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:51:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 18:51:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 18:51:12,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:12,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 18:51:12,663 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 18:51:12,663 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 18:51:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:12,666 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:51:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 18:51:12,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:12,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:12,667 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 18:51:12,667 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 18:51:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:12,670 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:51:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 18:51:12,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:12,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:12,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:12,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:51:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 18:51:12,674 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 18:51:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:12,674 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 18:51:12,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:51:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 18:51:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 18:51:12,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:12,676 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:12,677 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:12,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash -476474227, now seen corresponding path program 1 times [2018-11-14 18:51:12,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:12,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:12,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:12,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 18:51:12,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 18:51:12,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 18:51:12,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret12 := main(); {900#true} is VALID [2018-11-14 18:51:12,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:51:12,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:51:12,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:51:12,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:12,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:12,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 5); {901#false} is VALID [2018-11-14 18:51:12,794 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:51:12,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {900#true} is VALID [2018-11-14 18:51:12,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {900#true} is VALID [2018-11-14 18:51:12,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {900#true} is VALID [2018-11-14 18:51:12,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 5); {900#true} is VALID [2018-11-14 18:51:12,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:51:12,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,798 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 18:51:12,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 18:51:12,798 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:51:12,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {900#true} is VALID [2018-11-14 18:51:12,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {900#true} is VALID [2018-11-14 18:51:12,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {900#true} is VALID [2018-11-14 18:51:12,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 5); {900#true} is VALID [2018-11-14 18:51:12,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {900#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:51:12,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,800 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 18:51:12,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {901#false} is VALID [2018-11-14 18:51:12,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:12,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {901#false} is VALID [2018-11-14 18:51:12,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {901#false} is VALID [2018-11-14 18:51:12,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:12,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 4); {901#false} is VALID [2018-11-14 18:51:12,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {901#false} is VALID [2018-11-14 18:51:12,802 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:51:12,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {900#true} is VALID [2018-11-14 18:51:12,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {900#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {900#true} is VALID [2018-11-14 18:51:12,803 INFO L273 TraceCheckUtils]: 43: Hoare triple {900#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {900#true} is VALID [2018-11-14 18:51:12,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 5); {900#true} is VALID [2018-11-14 18:51:12,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {900#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:51:12,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:12,804 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 18:51:12,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {901#false} is VALID [2018-11-14 18:51:12,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {901#false} is VALID [2018-11-14 18:51:12,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 18:51:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:51:12,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:12,808 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-14 18:51:12,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:12,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:13,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 18:51:13,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 18:51:13,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:51:13,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 18:51:13,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret12 := main(); {900#true} is VALID [2018-11-14 18:51:13,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:51:13,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:51:13,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#(<= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:51:13,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:13,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:13,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 5); {901#false} is VALID [2018-11-14 18:51:13,213 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:51:13,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {901#false} is VALID [2018-11-14 18:51:13,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {901#false} is VALID [2018-11-14 18:51:13,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {901#false} is VALID [2018-11-14 18:51:13,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 5); {901#false} is VALID [2018-11-14 18:51:13,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:51:13,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,217 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 18:51:13,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 18:51:13,217 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:51:13,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {901#false} is VALID [2018-11-14 18:51:13,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {901#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {901#false} is VALID [2018-11-14 18:51:13,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {901#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {901#false} is VALID [2018-11-14 18:51:13,219 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 5); {901#false} is VALID [2018-11-14 18:51:13,219 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:51:13,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,220 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 18:51:13,220 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {901#false} is VALID [2018-11-14 18:51:13,220 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,221 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {901#false} is VALID [2018-11-14 18:51:13,221 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {901#false} is VALID [2018-11-14 18:51:13,221 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,221 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 4); {901#false} is VALID [2018-11-14 18:51:13,222 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {901#false} is VALID [2018-11-14 18:51:13,222 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:51:13,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {901#false} is VALID [2018-11-14 18:51:13,223 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,223 INFO L273 TraceCheckUtils]: 42: Hoare triple {901#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {901#false} is VALID [2018-11-14 18:51:13,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {901#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {901#false} is VALID [2018-11-14 18:51:13,223 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,224 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 5); {901#false} is VALID [2018-11-14 18:51:13,224 INFO L273 TraceCheckUtils]: 46: Hoare triple {901#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:51:13,224 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:51:13,224 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 18:51:13,225 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {901#false} is VALID [2018-11-14 18:51:13,225 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {901#false} is VALID [2018-11-14 18:51:13,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 18:51:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:51:13,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:13,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:51:13,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 18:51:13,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:13,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:51:13,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:13,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:51:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:51:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:51:13,345 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 18:51:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:13,482 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 18:51:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:51:13,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 18:51:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:51:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:51:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:51:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:51:13,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 18:51:13,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:13,654 INFO L225 Difference]: With dead ends: 63 [2018-11-14 18:51:13,655 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:51:13,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:51:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:51:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 18:51:13,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:13,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 18:51:13,670 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 18:51:13,671 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 18:51:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:13,674 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 18:51:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 18:51:13,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:13,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:13,675 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 18:51:13,675 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 18:51:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:13,678 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 18:51:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 18:51:13,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:13,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:13,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:13,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:51:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 18:51:13,682 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 18:51:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:13,682 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 18:51:13,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:51:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 18:51:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:51:13,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:13,684 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:13,685 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:13,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1438119929, now seen corresponding path program 2 times [2018-11-14 18:51:13,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:13,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:13,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:13,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:13,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:13,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 18:51:13,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 18:51:13,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 18:51:13,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret12 := main(); {1277#true} is VALID [2018-11-14 18:51:13,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:51:13,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:51:13,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {1279#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:51:13,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {1279#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:13,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:13,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:13,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:13,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:13,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 5); {1278#false} is VALID [2018-11-14 18:51:13,824 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:51:13,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1277#true} is VALID [2018-11-14 18:51:13,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {1277#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1277#true} is VALID [2018-11-14 18:51:13,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {1277#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1277#true} is VALID [2018-11-14 18:51:13,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 5); {1277#true} is VALID [2018-11-14 18:51:13,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:51:13,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,826 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 18:51:13,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 18:51:13,827 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:51:13,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1277#true} is VALID [2018-11-14 18:51:13,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {1277#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1277#true} is VALID [2018-11-14 18:51:13,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {1277#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1277#true} is VALID [2018-11-14 18:51:13,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 5); {1277#true} is VALID [2018-11-14 18:51:13,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:51:13,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,829 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 18:51:13,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1278#false} is VALID [2018-11-14 18:51:13,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:13,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {1278#false} is VALID [2018-11-14 18:51:13,829 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {1278#false} is VALID [2018-11-14 18:51:13,829 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:13,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 4); {1278#false} is VALID [2018-11-14 18:51:13,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {1278#false} is VALID [2018-11-14 18:51:13,830 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:51:13,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1277#true} is VALID [2018-11-14 18:51:13,830 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {1277#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1277#true} is VALID [2018-11-14 18:51:13,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {1277#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1277#true} is VALID [2018-11-14 18:51:13,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 5); {1277#true} is VALID [2018-11-14 18:51:13,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:51:13,831 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:13,832 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 18:51:13,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1278#false} is VALID [2018-11-14 18:51:13,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1278#false} is VALID [2018-11-14 18:51:13,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 18:51:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:51:13,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:13,835 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-14 18:51:13,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:51:13,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:51:13,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:51:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:13,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:14,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 18:51:14,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 18:51:14,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:51:14,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 18:51:14,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret12 := main(); {1277#true} is VALID [2018-11-14 18:51:14,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:51:14,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:51:14,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {1300#(<= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:51:14,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:14,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:14,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:14,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:14,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:14,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 5); {1278#false} is VALID [2018-11-14 18:51:14,099 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:51:14,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1278#false} is VALID [2018-11-14 18:51:14,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1278#false} is VALID [2018-11-14 18:51:14,101 INFO L273 TraceCheckUtils]: 18: Hoare triple {1278#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1278#false} is VALID [2018-11-14 18:51:14,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 5); {1278#false} is VALID [2018-11-14 18:51:14,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:51:14,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,102 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 18:51:14,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 18:51:14,103 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:51:14,103 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1278#false} is VALID [2018-11-14 18:51:14,103 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,104 INFO L273 TraceCheckUtils]: 28: Hoare triple {1278#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1278#false} is VALID [2018-11-14 18:51:14,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1278#false} is VALID [2018-11-14 18:51:14,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,104 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 5); {1278#false} is VALID [2018-11-14 18:51:14,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {1278#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:51:14,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,105 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 18:51:14,105 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1278#false} is VALID [2018-11-14 18:51:14,106 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,106 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {1278#false} is VALID [2018-11-14 18:51:14,106 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {1278#false} is VALID [2018-11-14 18:51:14,106 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,107 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 4); {1278#false} is VALID [2018-11-14 18:51:14,107 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {1278#false} is VALID [2018-11-14 18:51:14,107 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:51:14,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1278#false} is VALID [2018-11-14 18:51:14,108 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {1278#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1278#false} is VALID [2018-11-14 18:51:14,108 INFO L273 TraceCheckUtils]: 46: Hoare triple {1278#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1278#false} is VALID [2018-11-14 18:51:14,108 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,109 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 5); {1278#false} is VALID [2018-11-14 18:51:14,109 INFO L273 TraceCheckUtils]: 49: Hoare triple {1278#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:51:14,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:51:14,109 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 18:51:14,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1278#false} is VALID [2018-11-14 18:51:14,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1278#false} is VALID [2018-11-14 18:51:14,110 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 18:51:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:51:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:14,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:51:14,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 18:51:14,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:14,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:51:14,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:14,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:51:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:51:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:51:14,196 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 18:51:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:14,340 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:51:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:51:14,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 18:51:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:51:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 18:51:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:51:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 18:51:14,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 18:51:14,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:14,520 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:51:14,520 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:51:14,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:51:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:51:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 18:51:14,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:14,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 18:51:14,541 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 18:51:14,541 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 18:51:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:14,544 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:51:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:51:14,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:14,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:14,545 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 18:51:14,546 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 18:51:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:14,548 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:51:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:51:14,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:14,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:14,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:14,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:51:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 18:51:14,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 18:51:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:14,552 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 18:51:14,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:51:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 18:51:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:51:14,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:14,554 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:14,554 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:14,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1901603405, now seen corresponding path program 3 times [2018-11-14 18:51:14,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:14,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:51:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:14,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 18:51:14,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 18:51:14,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 18:51:14,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret12 := main(); {1678#true} is VALID [2018-11-14 18:51:14,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:51:14,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:51:14,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {1680#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:51:14,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {1680#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:14,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:14,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {1681#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:14,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:14,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:14,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~i~1 2)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:14,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 18:51:14,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 18:51:14,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 5); {1679#false} is VALID [2018-11-14 18:51:14,702 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:51:14,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1678#true} is VALID [2018-11-14 18:51:14,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1678#true} is VALID [2018-11-14 18:51:14,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1678#true} is VALID [2018-11-14 18:51:14,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 18:51:14,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:51:14,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,704 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 18:51:14,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1679#false} is VALID [2018-11-14 18:51:14,705 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:51:14,705 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1678#true} is VALID [2018-11-14 18:51:14,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1678#true} is VALID [2018-11-14 18:51:14,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1678#true} is VALID [2018-11-14 18:51:14,706 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,706 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 18:51:14,707 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:51:14,707 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,707 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 18:51:14,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {1679#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1679#false} is VALID [2018-11-14 18:51:14,707 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:51:14,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {1679#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {1679#false} is VALID [2018-11-14 18:51:14,708 INFO L273 TraceCheckUtils]: 41: Hoare triple {1679#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {1679#false} is VALID [2018-11-14 18:51:14,708 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:51:14,708 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 4); {1679#false} is VALID [2018-11-14 18:51:14,708 INFO L273 TraceCheckUtils]: 44: Hoare triple {1679#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {1679#false} is VALID [2018-11-14 18:51:14,708 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:51:14,709 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1678#true} is VALID [2018-11-14 18:51:14,709 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,709 INFO L273 TraceCheckUtils]: 48: Hoare triple {1678#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1678#true} is VALID [2018-11-14 18:51:14,709 INFO L273 TraceCheckUtils]: 49: Hoare triple {1678#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1678#true} is VALID [2018-11-14 18:51:14,709 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,709 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 18:51:14,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {1678#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:51:14,710 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:14,710 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 18:51:14,710 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1679#false} is VALID [2018-11-14 18:51:14,710 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1679#false} is VALID [2018-11-14 18:51:14,711 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 18:51:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:51:14,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:14,715 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-14 18:51:14,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:51:14,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:51:14,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:51:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:14,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:15,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 18:51:15,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 18:51:15,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 18:51:15,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret12 := main(); {1678#true} is VALID [2018-11-14 18:51:15,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1678#true} is VALID [2018-11-14 18:51:15,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {1678#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {1678#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {1678#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {1678#true} is VALID [2018-11-14 18:51:15,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {1678#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 5); {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1678#true} is VALID [2018-11-14 18:51:15,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1678#true} is VALID [2018-11-14 18:51:15,723 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:51:15,724 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,725 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 18:51:15,725 INFO L273 TraceCheckUtils]: 38: Hoare triple {1678#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1678#true} is VALID [2018-11-14 18:51:15,725 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {1678#true} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {1678#true} is VALID [2018-11-14 18:51:15,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {1678#true} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {1678#true} is VALID [2018-11-14 18:51:15,725 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:51:15,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 4); {1678#true} is VALID [2018-11-14 18:51:15,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {1678#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {1678#true} is VALID [2018-11-14 18:51:15,726 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:51:15,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1825#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:15,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= sum_~i~0 0)} assume true; {1825#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:15,741 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= sum_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1825#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:15,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1835#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:15,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= sum_~i~0 1)} assume true; {1835#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:15,744 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= sum_~i~0 1)} assume !(~i~0 < 5); {1679#false} is VALID [2018-11-14 18:51:15,744 INFO L273 TraceCheckUtils]: 52: Hoare triple {1679#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1679#false} is VALID [2018-11-14 18:51:15,744 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:51:15,744 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 18:51:15,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1679#false} is VALID [2018-11-14 18:51:15,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1679#false} is VALID [2018-11-14 18:51:15,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 18:51:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 18:51:15,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:15,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 18:51:15,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:51:15,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:15,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:51:15,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:51:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:51:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:51:15,966 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 18:51:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:16,356 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 18:51:16,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:51:16,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:51:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:51:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 18:51:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:51:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 18:51:16,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 18:51:16,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:16,486 INFO L225 Difference]: With dead ends: 73 [2018-11-14 18:51:16,486 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:51:16,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:51:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:51:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 18:51:16,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:16,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 18:51:16,506 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 18:51:16,506 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 18:51:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:16,508 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:51:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:51:16,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:16,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:16,509 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 18:51:16,509 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 18:51:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:16,512 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:51:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:51:16,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:16,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:16,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:16,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:51:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 18:51:16,516 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 18:51:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:16,516 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 18:51:16,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:51:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:51:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 18:51:16,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:16,518 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:16,518 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:16,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -922884994, now seen corresponding path program 4 times [2018-11-14 18:51:16,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:16,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:16,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:51:16,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:17,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 18:51:17,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 18:51:17,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 18:51:17,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret12 := main(); {2121#true} is VALID [2018-11-14 18:51:17,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:51:17,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:51:17,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:51:17,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {2123#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:17,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:17,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:51:17,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:17,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:17,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:51:17,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:51:17,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:51:17,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:51:17,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:51:17,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:51:17,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 5); {2122#false} is VALID [2018-11-14 18:51:17,039 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:51:17,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2121#true} is VALID [2018-11-14 18:51:17,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2121#true} is VALID [2018-11-14 18:51:17,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {2121#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2121#true} is VALID [2018-11-14 18:51:17,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {2121#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2121#true} is VALID [2018-11-14 18:51:17,041 INFO L273 TraceCheckUtils]: 27: Hoare triple {2121#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2121#true} is VALID [2018-11-14 18:51:17,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 5); {2121#true} is VALID [2018-11-14 18:51:17,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:51:17,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,042 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 18:51:17,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 18:51:17,042 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:51:17,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {2121#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 41: Hoare triple {2121#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2121#true} is VALID [2018-11-14 18:51:17,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,044 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 5); {2121#true} is VALID [2018-11-14 18:51:17,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {2121#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:51:17,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,044 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 18:51:17,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2122#false} is VALID [2018-11-14 18:51:17,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {2122#false} is VALID [2018-11-14 18:51:17,045 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {2122#false} is VALID [2018-11-14 18:51:17,045 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,045 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 4); {2122#false} is VALID [2018-11-14 18:51:17,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {2122#false} is VALID [2018-11-14 18:51:17,045 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:51:17,046 INFO L273 TraceCheckUtils]: 55: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2121#true} is VALID [2018-11-14 18:51:17,046 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {2121#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2121#true} is VALID [2018-11-14 18:51:17,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {2121#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2121#true} is VALID [2018-11-14 18:51:17,046 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {2121#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2121#true} is VALID [2018-11-14 18:51:17,047 INFO L273 TraceCheckUtils]: 61: Hoare triple {2121#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2121#true} is VALID [2018-11-14 18:51:17,047 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 5); {2121#true} is VALID [2018-11-14 18:51:17,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {2121#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:51:17,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,047 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 18:51:17,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2122#false} is VALID [2018-11-14 18:51:17,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2122#false} is VALID [2018-11-14 18:51:17,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 18:51:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:51:17,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:17,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:51:17,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:51:17,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:51:17,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:51:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:17,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:17,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret12 := main(); {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {2121#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {2121#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {2121#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {2121#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {2121#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2121#true} is VALID [2018-11-14 18:51:17,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {2121#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2121#true} is VALID [2018-11-14 18:51:17,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {2121#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2121#true} is VALID [2018-11-14 18:51:17,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {2121#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2121#true} is VALID [2018-11-14 18:51:17,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:51:17,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {2121#true} assume !(~i~1 < 5); {2121#true} is VALID [2018-11-14 18:51:17,335 INFO L256 TraceCheckUtils]: 20: Hoare triple {2121#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:51:17,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2194#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:17,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {2194#(<= sum_~i~0 0)} assume true; {2194#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:17,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {2194#(<= sum_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2194#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:17,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {2194#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2204#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:17,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {2204#(<= sum_~i~0 1)} assume true; {2204#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:17,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {2204#(<= sum_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2204#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:17,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {2204#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2214#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:17,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {2214#(<= sum_~i~0 2)} assume true; {2214#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:17,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {2214#(<= sum_~i~0 2)} assume !(~i~0 < 5); {2122#false} is VALID [2018-11-14 18:51:17,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {2122#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:51:17,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,343 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2121#true} #73#return; {2122#false} is VALID [2018-11-14 18:51:17,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 18:51:17,343 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:51:17,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2122#false} is VALID [2018-11-14 18:51:17,344 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,344 INFO L273 TraceCheckUtils]: 37: Hoare triple {2122#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2122#false} is VALID [2018-11-14 18:51:17,344 INFO L273 TraceCheckUtils]: 38: Hoare triple {2122#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2122#false} is VALID [2018-11-14 18:51:17,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {2122#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2122#false} is VALID [2018-11-14 18:51:17,345 INFO L273 TraceCheckUtils]: 41: Hoare triple {2122#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2122#false} is VALID [2018-11-14 18:51:17,345 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,345 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 5); {2122#false} is VALID [2018-11-14 18:51:17,345 INFO L273 TraceCheckUtils]: 44: Hoare triple {2122#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,346 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 4); {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 55: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 57: Hoare triple {2122#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 58: Hoare triple {2122#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,347 INFO L273 TraceCheckUtils]: 60: Hoare triple {2122#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2122#false} is VALID [2018-11-14 18:51:17,348 INFO L273 TraceCheckUtils]: 61: Hoare triple {2122#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2122#false} is VALID [2018-11-14 18:51:17,348 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,348 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 5); {2122#false} is VALID [2018-11-14 18:51:17,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {2122#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:51:17,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:51:17,349 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 18:51:17,349 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2122#false} is VALID [2018-11-14 18:51:17,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2122#false} is VALID [2018-11-14 18:51:17,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 18:51:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 46 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-14 18:51:17,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:17,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-14 18:51:17,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-11-14 18:51:17,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:17,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:51:17,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:17,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:51:17,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:51:17,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:51:17,457 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2018-11-14 18:51:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:17,806 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-14 18:51:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:51:17,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-11-14 18:51:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:51:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-14 18:51:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:51:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-14 18:51:17,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2018-11-14 18:51:18,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:18,048 INFO L225 Difference]: With dead ends: 81 [2018-11-14 18:51:18,048 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:51:18,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:51:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:51:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-14 18:51:18,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:18,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-14 18:51:18,090 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-14 18:51:18,090 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-14 18:51:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:18,092 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 18:51:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 18:51:18,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:18,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:18,093 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-14 18:51:18,093 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-14 18:51:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:18,096 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 18:51:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 18:51:18,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:18,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:18,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:18,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:51:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-14 18:51:18,099 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 70 [2018-11-14 18:51:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:18,099 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-14 18:51:18,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:51:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-14 18:51:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 18:51:18,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:18,100 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:18,101 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:18,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1121268115, now seen corresponding path program 5 times [2018-11-14 18:51:18,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:18,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:18,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:18,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:51:18,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:18,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2631#true} is VALID [2018-11-14 18:51:18,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {2631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2631#true} is VALID [2018-11-14 18:51:18,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2631#true} {2631#true} #69#return; {2631#true} is VALID [2018-11-14 18:51:18,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2018-11-14 18:51:18,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {2631#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2631#true} is VALID [2018-11-14 18:51:18,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {2631#true} assume !(~i~1 < 5); {2631#true} is VALID [2018-11-14 18:51:18,392 INFO L256 TraceCheckUtils]: 23: Hoare triple {2631#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 18:51:18,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {2631#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2633#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:18,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {2633#(= sum_~i~0 0)} assume true; {2633#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:18,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {2633#(= sum_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2633#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:18,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {2633#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2634#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:18,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {2634#(<= sum_~i~0 1)} assume true; {2634#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:18,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {2634#(<= sum_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2634#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:18,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {2634#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2635#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:18,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#(<= sum_~i~0 2)} assume true; {2635#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:18,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {2635#(<= sum_~i~0 2)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2635#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:18,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2636#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:18,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {2636#(<= sum_~i~0 3)} assume true; {2636#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:18,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {2636#(<= sum_~i~0 3)} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 18:51:18,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {2632#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 18:51:18,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,412 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2632#false} {2631#true} #73#return; {2632#false} is VALID [2018-11-14 18:51:18,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {2632#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2632#false} is VALID [2018-11-14 18:51:18,412 INFO L256 TraceCheckUtils]: 40: Hoare triple {2632#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 18:51:18,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {2631#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2631#true} is VALID [2018-11-14 18:51:18,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {2631#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {2631#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {2631#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {2631#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {2631#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2631#true} is VALID [2018-11-14 18:51:18,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {2631#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#true} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 51: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 52: Hoare triple {2631#true} assume !(~i~0 < 5); {2631#true} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 53: Hoare triple {2631#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2631#true} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 54: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,414 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2631#true} {2632#false} #75#return; {2632#false} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {2632#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2632#false} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {2632#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {2632#false} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 59: Hoare triple {2632#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {2632#false} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {2632#false} assume !(~i~2 < 4); {2632#false} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 62: Hoare triple {2632#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {2632#false} is VALID [2018-11-14 18:51:18,415 INFO L256 TraceCheckUtils]: 63: Hoare triple {2632#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {2631#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2631#true} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {2631#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 67: Hoare triple {2631#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 69: Hoare triple {2631#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 70: Hoare triple {2631#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 71: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 72: Hoare triple {2631#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2631#true} is VALID [2018-11-14 18:51:18,416 INFO L273 TraceCheckUtils]: 73: Hoare triple {2631#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#true} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 75: Hoare triple {2631#true} assume !(~i~0 < 5); {2631#true} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 76: Hoare triple {2631#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2631#true} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 77: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,417 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2631#true} {2632#false} #77#return; {2632#false} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 79: Hoare triple {2632#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2632#false} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 80: Hoare triple {2632#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2632#false} is VALID [2018-11-14 18:51:18,417 INFO L273 TraceCheckUtils]: 81: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2018-11-14 18:51:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-14 18:51:18,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:18,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:51:18,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:51:18,479 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 18:51:18,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:51:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:18,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:18,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2631#true} is VALID [2018-11-14 18:51:18,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {2631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2631#true} is VALID [2018-11-14 18:51:18,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2631#true} {2631#true} #69#return; {2631#true} is VALID [2018-11-14 18:51:18,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2018-11-14 18:51:18,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {2631#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2631#true} is VALID [2018-11-14 18:51:18,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {2631#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {2631#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 21: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {2631#true} assume !(~i~1 < 5); {2631#true} is VALID [2018-11-14 18:51:18,674 INFO L256 TraceCheckUtils]: 23: Hoare triple {2631#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 18:51:18,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {2631#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2712#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:18,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {2712#(<= sum_~i~0 0)} assume true; {2712#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:18,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {2712#(<= sum_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2712#(<= sum_~i~0 0)} is VALID [2018-11-14 18:51:18,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {2712#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2634#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:18,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {2634#(<= sum_~i~0 1)} assume true; {2634#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:18,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {2634#(<= sum_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2634#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:18,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {2634#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2635#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:18,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#(<= sum_~i~0 2)} assume true; {2635#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:18,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {2635#(<= sum_~i~0 2)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2635#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:18,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2636#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:18,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {2636#(<= sum_~i~0 3)} assume true; {2636#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:18,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {2636#(<= sum_~i~0 3)} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 18:51:18,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {2632#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 18:51:18,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2632#false} {2631#true} #73#return; {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {2632#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L256 TraceCheckUtils]: 40: Hoare triple {2632#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {2632#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {2632#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2632#false} is VALID [2018-11-14 18:51:18,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {2632#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 45: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 46: Hoare triple {2632#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {2632#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {2632#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 50: Hoare triple {2632#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 51: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {2632#false} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 18:51:18,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {2632#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 18:51:18,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,757 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2632#false} {2632#false} #75#return; {2632#false} is VALID [2018-11-14 18:51:18,757 INFO L273 TraceCheckUtils]: 56: Hoare triple {2632#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2632#false} is VALID [2018-11-14 18:51:18,757 INFO L273 TraceCheckUtils]: 57: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,758 INFO L273 TraceCheckUtils]: 58: Hoare triple {2632#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {2632#false} is VALID [2018-11-14 18:51:18,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {2632#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {2632#false} is VALID [2018-11-14 18:51:18,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {2632#false} assume !(~i~2 < 4); {2632#false} is VALID [2018-11-14 18:51:18,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {2632#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {2632#false} is VALID [2018-11-14 18:51:18,758 INFO L256 TraceCheckUtils]: 63: Hoare triple {2632#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2632#false} is VALID [2018-11-14 18:51:18,759 INFO L273 TraceCheckUtils]: 64: Hoare triple {2632#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2632#false} is VALID [2018-11-14 18:51:18,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {2632#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2632#false} is VALID [2018-11-14 18:51:18,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {2632#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#false} is VALID [2018-11-14 18:51:18,759 INFO L273 TraceCheckUtils]: 68: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,759 INFO L273 TraceCheckUtils]: 69: Hoare triple {2632#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2632#false} is VALID [2018-11-14 18:51:18,760 INFO L273 TraceCheckUtils]: 70: Hoare triple {2632#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#false} is VALID [2018-11-14 18:51:18,760 INFO L273 TraceCheckUtils]: 71: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,760 INFO L273 TraceCheckUtils]: 72: Hoare triple {2632#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2632#false} is VALID [2018-11-14 18:51:18,760 INFO L273 TraceCheckUtils]: 73: Hoare triple {2632#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#false} is VALID [2018-11-14 18:51:18,760 INFO L273 TraceCheckUtils]: 74: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {2632#false} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 18:51:18,761 INFO L273 TraceCheckUtils]: 76: Hoare triple {2632#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 18:51:18,761 INFO L273 TraceCheckUtils]: 77: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 18:51:18,761 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2632#false} {2632#false} #77#return; {2632#false} is VALID [2018-11-14 18:51:18,761 INFO L273 TraceCheckUtils]: 79: Hoare triple {2632#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2632#false} is VALID [2018-11-14 18:51:18,761 INFO L273 TraceCheckUtils]: 80: Hoare triple {2632#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2632#false} is VALID [2018-11-14 18:51:18,762 INFO L273 TraceCheckUtils]: 81: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2018-11-14 18:51:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 84 proven. 15 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-14 18:51:18,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:18,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:51:18,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-14 18:51:18,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:18,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:51:18,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:18,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:51:18,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:51:18,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:51:18,902 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-11-14 18:51:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:19,206 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 18:51:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:51:19,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-14 18:51:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:51:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 18:51:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:51:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 18:51:19,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2018-11-14 18:51:19,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:19,311 INFO L225 Difference]: With dead ends: 86 [2018-11-14 18:51:19,312 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:51:19,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:51:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:51:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-14 18:51:19,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:19,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-14 18:51:19,335 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-14 18:51:19,335 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-14 18:51:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:19,338 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 18:51:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-14 18:51:19,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:19,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:19,339 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-14 18:51:19,339 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-14 18:51:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:19,342 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 18:51:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-14 18:51:19,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:19,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:19,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:19,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:51:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 18:51:19,345 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 82 [2018-11-14 18:51:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:19,345 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 18:51:19,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:51:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 18:51:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 18:51:19,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:19,347 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:19,347 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:19,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1266493208, now seen corresponding path program 6 times [2018-11-14 18:51:19,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:19,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:19,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:51:19,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:19,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {3190#true} call ULTIMATE.init(); {3190#true} is VALID [2018-11-14 18:51:19,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {3190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3190#true} is VALID [2018-11-14 18:51:19,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3190#true} {3190#true} #69#return; {3190#true} is VALID [2018-11-14 18:51:19,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {3190#true} call #t~ret12 := main(); {3190#true} is VALID [2018-11-14 18:51:19,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {3190#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3190#true} is VALID [2018-11-14 18:51:19,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 18: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,560 INFO L273 TraceCheckUtils]: 20: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {3190#true} assume !(~i~1 < 5); {3190#true} is VALID [2018-11-14 18:51:19,560 INFO L256 TraceCheckUtils]: 23: Hoare triple {3190#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 18:51:19,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3192#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:19,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {3192#(= sum_~i~0 0)} assume true; {3192#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:19,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {3192#(= sum_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3192#(= sum_~i~0 0)} is VALID [2018-11-14 18:51:19,561 INFO L273 TraceCheckUtils]: 27: Hoare triple {3192#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3193#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:19,562 INFO L273 TraceCheckUtils]: 28: Hoare triple {3193#(<= sum_~i~0 1)} assume true; {3193#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:19,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {3193#(<= sum_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3193#(<= sum_~i~0 1)} is VALID [2018-11-14 18:51:19,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {3193#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3194#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:19,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#(<= sum_~i~0 2)} assume true; {3194#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:19,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#(<= sum_~i~0 2)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3194#(<= sum_~i~0 2)} is VALID [2018-11-14 18:51:19,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3195#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:19,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {3195#(<= sum_~i~0 3)} assume true; {3195#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:19,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {3195#(<= sum_~i~0 3)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3195#(<= sum_~i~0 3)} is VALID [2018-11-14 18:51:19,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {3195#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3196#(<= sum_~i~0 4)} is VALID [2018-11-14 18:51:19,566 INFO L273 TraceCheckUtils]: 37: Hoare triple {3196#(<= sum_~i~0 4)} assume true; {3196#(<= sum_~i~0 4)} is VALID [2018-11-14 18:51:19,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {3196#(<= sum_~i~0 4)} assume !(~i~0 < 5); {3191#false} is VALID [2018-11-14 18:51:19,567 INFO L273 TraceCheckUtils]: 39: Hoare triple {3191#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3191#false} is VALID [2018-11-14 18:51:19,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,567 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3191#false} {3190#true} #73#return; {3191#false} is VALID [2018-11-14 18:51:19,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {3191#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3191#false} is VALID [2018-11-14 18:51:19,568 INFO L256 TraceCheckUtils]: 43: Hoare triple {3191#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 18:51:19,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#true} is VALID [2018-11-14 18:51:19,568 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,569 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,569 INFO L273 TraceCheckUtils]: 49: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,570 INFO L273 TraceCheckUtils]: 56: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,571 INFO L273 TraceCheckUtils]: 58: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 18:51:19,571 INFO L273 TraceCheckUtils]: 59: Hoare triple {3190#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 18:51:19,571 INFO L273 TraceCheckUtils]: 60: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,571 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3190#true} {3191#false} #75#return; {3191#false} is VALID [2018-11-14 18:51:19,571 INFO L273 TraceCheckUtils]: 62: Hoare triple {3191#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3191#false} is VALID [2018-11-14 18:51:19,571 INFO L273 TraceCheckUtils]: 63: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,572 INFO L273 TraceCheckUtils]: 64: Hoare triple {3191#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {3191#false} is VALID [2018-11-14 18:51:19,572 INFO L273 TraceCheckUtils]: 65: Hoare triple {3191#false} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {3191#false} is VALID [2018-11-14 18:51:19,572 INFO L273 TraceCheckUtils]: 66: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,572 INFO L273 TraceCheckUtils]: 67: Hoare triple {3191#false} assume !(~i~2 < 4); {3191#false} is VALID [2018-11-14 18:51:19,572 INFO L273 TraceCheckUtils]: 68: Hoare triple {3191#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {3191#false} is VALID [2018-11-14 18:51:19,572 INFO L256 TraceCheckUtils]: 69: Hoare triple {3191#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 18:51:19,573 INFO L273 TraceCheckUtils]: 70: Hoare triple {3190#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#true} is VALID [2018-11-14 18:51:19,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,573 INFO L273 TraceCheckUtils]: 72: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,573 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,573 INFO L273 TraceCheckUtils]: 74: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,573 INFO L273 TraceCheckUtils]: 75: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,574 INFO L273 TraceCheckUtils]: 79: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,574 INFO L273 TraceCheckUtils]: 80: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,574 INFO L273 TraceCheckUtils]: 81: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,575 INFO L273 TraceCheckUtils]: 82: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,575 INFO L273 TraceCheckUtils]: 83: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,575 INFO L273 TraceCheckUtils]: 84: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 18:51:19,575 INFO L273 TraceCheckUtils]: 85: Hoare triple {3190#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 18:51:19,575 INFO L273 TraceCheckUtils]: 86: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,575 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3190#true} {3191#false} #77#return; {3191#false} is VALID [2018-11-14 18:51:19,576 INFO L273 TraceCheckUtils]: 88: Hoare triple {3191#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3191#false} is VALID [2018-11-14 18:51:19,576 INFO L273 TraceCheckUtils]: 89: Hoare triple {3191#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3191#false} is VALID [2018-11-14 18:51:19,576 INFO L273 TraceCheckUtils]: 90: Hoare triple {3191#false} assume !false; {3191#false} is VALID [2018-11-14 18:51:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-14 18:51:19,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:19,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:51:19,592 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:51:19,687 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 18:51:19,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:51:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:19,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:19,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {3190#true} call ULTIMATE.init(); {3190#true} is VALID [2018-11-14 18:51:19,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {3190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3190#true} is VALID [2018-11-14 18:51:19,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3190#true} {3190#true} #69#return; {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L256 TraceCheckUtils]: 4: Hoare triple {3190#true} call #t~ret12 := main(); {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {3190#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {3190#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {3190#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {3190#true} assume !(~i~1 < 5); {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L256 TraceCheckUtils]: 23: Hoare triple {3190#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#true} is VALID [2018-11-14 18:51:19,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 36: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,882 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3190#true} {3190#true} #73#return; {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L256 TraceCheckUtils]: 43: Hoare triple {3190#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,884 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,884 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,884 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,884 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,884 INFO L273 TraceCheckUtils]: 54: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,884 INFO L273 TraceCheckUtils]: 55: Hoare triple {3190#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#true} is VALID [2018-11-14 18:51:19,885 INFO L273 TraceCheckUtils]: 56: Hoare triple {3190#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3190#true} is VALID [2018-11-14 18:51:19,885 INFO L273 TraceCheckUtils]: 57: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,885 INFO L273 TraceCheckUtils]: 58: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 18:51:19,885 INFO L273 TraceCheckUtils]: 59: Hoare triple {3190#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 18:51:19,885 INFO L273 TraceCheckUtils]: 60: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 18:51:19,885 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3190#true} {3190#true} #75#return; {3190#true} is VALID [2018-11-14 18:51:19,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {3190#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3386#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:19,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {3386#(<= main_~i~2 0)} assume true; {3386#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:19,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {3386#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {3386#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:19,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {3386#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {3396#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:19,890 INFO L273 TraceCheckUtils]: 66: Hoare triple {3396#(<= main_~i~2 1)} assume true; {3396#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {3396#(<= main_~i~2 1)} assume !(~i~2 < 4); {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {3191#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L256 TraceCheckUtils]: 69: Hoare triple {3191#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 70: Hoare triple {3191#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 71: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 72: Hoare triple {3191#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 73: Hoare triple {3191#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3191#false} is VALID [2018-11-14 18:51:19,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 75: Hoare triple {3191#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 76: Hoare triple {3191#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 77: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 78: Hoare triple {3191#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 79: Hoare triple {3191#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 80: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 81: Hoare triple {3191#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3191#false} is VALID [2018-11-14 18:51:19,892 INFO L273 TraceCheckUtils]: 82: Hoare triple {3191#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 83: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 84: Hoare triple {3191#false} assume !(~i~0 < 5); {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 85: Hoare triple {3191#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 86: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3191#false} {3191#false} #77#return; {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 88: Hoare triple {3191#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 89: Hoare triple {3191#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3191#false} is VALID [2018-11-14 18:51:19,893 INFO L273 TraceCheckUtils]: 90: Hoare triple {3191#false} assume !false; {3191#false} is VALID [2018-11-14 18:51:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-14 18:51:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-11-14 18:51:19,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-14 18:51:19,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:19,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:51:19,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:19,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:51:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:51:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:51:19,980 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-14 18:51:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:20,409 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-11-14 18:51:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:51:20,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-14 18:51:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:51:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-14 18:51:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:51:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-14 18:51:20,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2018-11-14 18:51:20,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:20,499 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:51:20,499 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 18:51:20,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:51:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 18:51:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-14 18:51:20,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:20,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-14 18:51:20,525 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-14 18:51:20,525 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-14 18:51:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:20,527 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-14 18:51:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-14 18:51:20,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:20,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:20,528 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-14 18:51:20,528 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-14 18:51:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:20,530 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-14 18:51:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-14 18:51:20,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:20,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:20,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:20,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:51:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 18:51:20,532 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 91 [2018-11-14 18:51:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:20,533 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 18:51:20,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:51:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 18:51:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 18:51:20,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:20,534 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:20,534 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:20,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1570363553, now seen corresponding path program 7 times [2018-11-14 18:51:20,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:20,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:20,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:20,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:51:20,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:20,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {3810#true} call ULTIMATE.init(); {3810#true} is VALID [2018-11-14 18:51:20,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {3810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3810#true} is VALID [2018-11-14 18:51:20,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3810#true} {3810#true} #69#return; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {3810#true} call #t~ret12 := main(); {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {3810#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {3810#true} assume !(~i~1 < 5); {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L256 TraceCheckUtils]: 23: Hoare triple {3810#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {3810#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 40: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {3810#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3810#true} {3810#true} #73#return; {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {3810#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L256 TraceCheckUtils]: 46: Hoare triple {3810#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 18:51:20,692 INFO L273 TraceCheckUtils]: 47: Hoare triple {3810#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 48: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 59: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,694 INFO L273 TraceCheckUtils]: 63: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,695 INFO L273 TraceCheckUtils]: 64: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 18:51:20,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {3810#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 18:51:20,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,695 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3810#true} {3810#true} #75#return; {3810#true} is VALID [2018-11-14 18:51:20,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {3810#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3812#(= main_~i~2 0)} is VALID [2018-11-14 18:51:20,696 INFO L273 TraceCheckUtils]: 69: Hoare triple {3812#(= main_~i~2 0)} assume true; {3812#(= main_~i~2 0)} is VALID [2018-11-14 18:51:20,699 INFO L273 TraceCheckUtils]: 70: Hoare triple {3812#(= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {3812#(= main_~i~2 0)} is VALID [2018-11-14 18:51:20,699 INFO L273 TraceCheckUtils]: 71: Hoare triple {3812#(= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:20,702 INFO L273 TraceCheckUtils]: 72: Hoare triple {3813#(<= main_~i~2 1)} assume true; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:20,702 INFO L273 TraceCheckUtils]: 73: Hoare triple {3813#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:20,704 INFO L273 TraceCheckUtils]: 74: Hoare triple {3813#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {3814#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:20,704 INFO L273 TraceCheckUtils]: 75: Hoare triple {3814#(<= main_~i~2 2)} assume true; {3814#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:20,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {3814#(<= main_~i~2 2)} assume !(~i~2 < 4); {3811#false} is VALID [2018-11-14 18:51:20,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {3811#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {3811#false} is VALID [2018-11-14 18:51:20,706 INFO L256 TraceCheckUtils]: 78: Hoare triple {3811#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 18:51:20,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {3810#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3810#true} is VALID [2018-11-14 18:51:20,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 85: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 86: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 91: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 93: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 94: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 95: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 18:51:20,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {3810#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 18:51:20,709 INFO L273 TraceCheckUtils]: 98: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,709 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {3810#true} {3811#false} #77#return; {3811#false} is VALID [2018-11-14 18:51:20,709 INFO L273 TraceCheckUtils]: 100: Hoare triple {3811#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3811#false} is VALID [2018-11-14 18:51:20,709 INFO L273 TraceCheckUtils]: 101: Hoare triple {3811#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3811#false} is VALID [2018-11-14 18:51:20,709 INFO L273 TraceCheckUtils]: 102: Hoare triple {3811#false} assume !false; {3811#false} is VALID [2018-11-14 18:51:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-11-14 18:51:20,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:20,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:51:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:20,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:20,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {3810#true} call ULTIMATE.init(); {3810#true} is VALID [2018-11-14 18:51:20,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {3810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3810#true} is VALID [2018-11-14 18:51:20,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3810#true} {3810#true} #69#return; {3810#true} is VALID [2018-11-14 18:51:20,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {3810#true} call #t~ret12 := main(); {3810#true} is VALID [2018-11-14 18:51:20,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {3810#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3810#true} is VALID [2018-11-14 18:51:20,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {3810#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {3810#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {3810#true} assume !(~i~1 < 5); {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L256 TraceCheckUtils]: 23: Hoare triple {3810#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {3810#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 29: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 42: Hoare triple {3810#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 18:51:20,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3810#true} {3810#true} #73#return; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {3810#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L256 TraceCheckUtils]: 46: Hoare triple {3810#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {3810#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,997 INFO L273 TraceCheckUtils]: 52: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 53: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 54: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 56: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 57: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 58: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 59: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L273 TraceCheckUtils]: 61: Hoare triple {3810#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L273 TraceCheckUtils]: 62: Hoare triple {3810#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L273 TraceCheckUtils]: 63: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L273 TraceCheckUtils]: 64: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {3810#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 18:51:20,999 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3810#true} {3810#true} #75#return; {3810#true} is VALID [2018-11-14 18:51:21,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {3810#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4022#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:21,000 INFO L273 TraceCheckUtils]: 69: Hoare triple {4022#(<= main_~i~2 0)} assume true; {4022#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:21,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {4022#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4022#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:21,001 INFO L273 TraceCheckUtils]: 71: Hoare triple {4022#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:21,001 INFO L273 TraceCheckUtils]: 72: Hoare triple {3813#(<= main_~i~2 1)} assume true; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:21,002 INFO L273 TraceCheckUtils]: 73: Hoare triple {3813#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:21,002 INFO L273 TraceCheckUtils]: 74: Hoare triple {3813#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {3814#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:21,002 INFO L273 TraceCheckUtils]: 75: Hoare triple {3814#(<= main_~i~2 2)} assume true; {3814#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:21,003 INFO L273 TraceCheckUtils]: 76: Hoare triple {3814#(<= main_~i~2 2)} assume !(~i~2 < 4); {3811#false} is VALID [2018-11-14 18:51:21,003 INFO L273 TraceCheckUtils]: 77: Hoare triple {3811#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {3811#false} is VALID [2018-11-14 18:51:21,003 INFO L256 TraceCheckUtils]: 78: Hoare triple {3811#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3811#false} is VALID [2018-11-14 18:51:21,003 INFO L273 TraceCheckUtils]: 79: Hoare triple {3811#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3811#false} is VALID [2018-11-14 18:51:21,003 INFO L273 TraceCheckUtils]: 80: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,004 INFO L273 TraceCheckUtils]: 81: Hoare triple {3811#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3811#false} is VALID [2018-11-14 18:51:21,004 INFO L273 TraceCheckUtils]: 82: Hoare triple {3811#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3811#false} is VALID [2018-11-14 18:51:21,004 INFO L273 TraceCheckUtils]: 83: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,004 INFO L273 TraceCheckUtils]: 84: Hoare triple {3811#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3811#false} is VALID [2018-11-14 18:51:21,004 INFO L273 TraceCheckUtils]: 85: Hoare triple {3811#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3811#false} is VALID [2018-11-14 18:51:21,005 INFO L273 TraceCheckUtils]: 86: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,005 INFO L273 TraceCheckUtils]: 87: Hoare triple {3811#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3811#false} is VALID [2018-11-14 18:51:21,005 INFO L273 TraceCheckUtils]: 88: Hoare triple {3811#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3811#false} is VALID [2018-11-14 18:51:21,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {3811#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3811#false} is VALID [2018-11-14 18:51:21,005 INFO L273 TraceCheckUtils]: 91: Hoare triple {3811#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 92: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {3811#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {3811#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 95: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 96: Hoare triple {3811#false} assume !(~i~0 < 5); {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 97: Hoare triple {3811#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L273 TraceCheckUtils]: 98: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 18:51:21,006 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {3811#false} {3811#false} #77#return; {3811#false} is VALID [2018-11-14 18:51:21,007 INFO L273 TraceCheckUtils]: 100: Hoare triple {3811#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3811#false} is VALID [2018-11-14 18:51:21,007 INFO L273 TraceCheckUtils]: 101: Hoare triple {3811#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3811#false} is VALID [2018-11-14 18:51:21,007 INFO L273 TraceCheckUtils]: 102: Hoare triple {3811#false} assume !false; {3811#false} is VALID [2018-11-14 18:51:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-14 18:51:21,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:21,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:51:21,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-14 18:51:21,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:21,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:51:21,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:21,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:51:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:51:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:51:21,107 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2018-11-14 18:51:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:21,250 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-11-14 18:51:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:51:21,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-14 18:51:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:51:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-14 18:51:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:51:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-14 18:51:21,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-11-14 18:51:21,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:21,309 INFO L225 Difference]: With dead ends: 93 [2018-11-14 18:51:21,309 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:51:21,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:51:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:51:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 18:51:21,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:21,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 18:51:21,347 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 18:51:21,347 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 18:51:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:21,349 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:51:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:51:21,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:21,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:21,350 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 18:51:21,350 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 18:51:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:21,352 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:51:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:51:21,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:21,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:21,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:21,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:51:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 18:51:21,355 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 103 [2018-11-14 18:51:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:21,355 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 18:51:21,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:51:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 18:51:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 18:51:21,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:21,356 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 6, 5, 5, 4, 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-14 18:51:21,357 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:21,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash -990841971, now seen corresponding path program 8 times [2018-11-14 18:51:21,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:21,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:21,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:21,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:21,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:21,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {4470#true} call ULTIMATE.init(); {4470#true} is VALID [2018-11-14 18:51:21,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {4470#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4470#true} is VALID [2018-11-14 18:51:21,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4470#true} {4470#true} #69#return; {4470#true} is VALID [2018-11-14 18:51:21,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {4470#true} call #t~ret12 := main(); {4470#true} is VALID [2018-11-14 18:51:21,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {4470#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:21,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:21,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:21,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:21,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:21,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,934 INFO L273 TraceCheckUtils]: 19: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:21,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:21,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {4470#true} assume !(~i~1 < 5); {4470#true} is VALID [2018-11-14 18:51:21,934 INFO L256 TraceCheckUtils]: 23: Hoare triple {4470#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 18:51:21,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {4470#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,936 INFO L273 TraceCheckUtils]: 32: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,936 INFO L273 TraceCheckUtils]: 36: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,936 INFO L273 TraceCheckUtils]: 37: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L273 TraceCheckUtils]: 38: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L273 TraceCheckUtils]: 39: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L273 TraceCheckUtils]: 40: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L273 TraceCheckUtils]: 41: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {4470#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L273 TraceCheckUtils]: 43: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,937 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4470#true} {4470#true} #73#return; {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L273 TraceCheckUtils]: 45: Hoare triple {4470#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L256 TraceCheckUtils]: 46: Hoare triple {4470#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L273 TraceCheckUtils]: 47: Hoare triple {4470#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L273 TraceCheckUtils]: 49: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L273 TraceCheckUtils]: 50: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,938 INFO L273 TraceCheckUtils]: 51: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 52: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 53: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 54: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 55: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 57: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 58: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,939 INFO L273 TraceCheckUtils]: 59: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 60: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 61: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 62: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 63: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 64: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 65: Hoare triple {4470#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L273 TraceCheckUtils]: 66: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,940 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4470#true} {4470#true} #75#return; {4470#true} is VALID [2018-11-14 18:51:21,947 INFO L273 TraceCheckUtils]: 68: Hoare triple {4470#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4472#(= main_~i~2 0)} is VALID [2018-11-14 18:51:21,948 INFO L273 TraceCheckUtils]: 69: Hoare triple {4472#(= main_~i~2 0)} assume true; {4472#(= main_~i~2 0)} is VALID [2018-11-14 18:51:21,948 INFO L273 TraceCheckUtils]: 70: Hoare triple {4472#(= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4472#(= main_~i~2 0)} is VALID [2018-11-14 18:51:21,949 INFO L273 TraceCheckUtils]: 71: Hoare triple {4472#(= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:21,949 INFO L273 TraceCheckUtils]: 72: Hoare triple {4473#(<= main_~i~2 1)} assume true; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:21,949 INFO L273 TraceCheckUtils]: 73: Hoare triple {4473#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:21,950 INFO L273 TraceCheckUtils]: 74: Hoare triple {4473#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:21,950 INFO L273 TraceCheckUtils]: 75: Hoare triple {4474#(<= main_~i~2 2)} assume true; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:21,951 INFO L273 TraceCheckUtils]: 76: Hoare triple {4474#(<= main_~i~2 2)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:21,951 INFO L273 TraceCheckUtils]: 77: Hoare triple {4474#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {4475#(<= main_~i~2 3)} is VALID [2018-11-14 18:51:21,952 INFO L273 TraceCheckUtils]: 78: Hoare triple {4475#(<= main_~i~2 3)} assume true; {4475#(<= main_~i~2 3)} is VALID [2018-11-14 18:51:21,952 INFO L273 TraceCheckUtils]: 79: Hoare triple {4475#(<= main_~i~2 3)} assume !(~i~2 < 4); {4471#false} is VALID [2018-11-14 18:51:21,952 INFO L273 TraceCheckUtils]: 80: Hoare triple {4471#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {4471#false} is VALID [2018-11-14 18:51:21,953 INFO L256 TraceCheckUtils]: 81: Hoare triple {4471#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 18:51:21,953 INFO L273 TraceCheckUtils]: 82: Hoare triple {4470#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4470#true} is VALID [2018-11-14 18:51:21,953 INFO L273 TraceCheckUtils]: 83: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,953 INFO L273 TraceCheckUtils]: 84: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,953 INFO L273 TraceCheckUtils]: 85: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,954 INFO L273 TraceCheckUtils]: 86: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,954 INFO L273 TraceCheckUtils]: 87: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,954 INFO L273 TraceCheckUtils]: 88: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,954 INFO L273 TraceCheckUtils]: 89: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,954 INFO L273 TraceCheckUtils]: 90: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,955 INFO L273 TraceCheckUtils]: 91: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,955 INFO L273 TraceCheckUtils]: 92: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,955 INFO L273 TraceCheckUtils]: 93: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,955 INFO L273 TraceCheckUtils]: 94: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,955 INFO L273 TraceCheckUtils]: 95: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,956 INFO L273 TraceCheckUtils]: 96: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:21,956 INFO L273 TraceCheckUtils]: 97: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:21,956 INFO L273 TraceCheckUtils]: 98: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,956 INFO L273 TraceCheckUtils]: 99: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 18:51:21,956 INFO L273 TraceCheckUtils]: 100: Hoare triple {4470#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 18:51:21,956 INFO L273 TraceCheckUtils]: 101: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:21,957 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {4470#true} {4471#false} #77#return; {4471#false} is VALID [2018-11-14 18:51:21,957 INFO L273 TraceCheckUtils]: 103: Hoare triple {4471#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4471#false} is VALID [2018-11-14 18:51:21,957 INFO L273 TraceCheckUtils]: 104: Hoare triple {4471#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4471#false} is VALID [2018-11-14 18:51:21,957 INFO L273 TraceCheckUtils]: 105: Hoare triple {4471#false} assume !false; {4471#false} is VALID [2018-11-14 18:51:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-11-14 18:51:21,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:51:21,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:51:21,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:51:22,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:51:22,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:51:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:22,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:51:22,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {4470#true} call ULTIMATE.init(); {4470#true} is VALID [2018-11-14 18:51:22,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {4470#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4470#true} is VALID [2018-11-14 18:51:22,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4470#true} {4470#true} #69#return; {4470#true} is VALID [2018-11-14 18:51:22,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {4470#true} call #t~ret12 := main(); {4470#true} is VALID [2018-11-14 18:51:22,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {4470#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4470#true} is VALID [2018-11-14 18:51:22,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:22,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:22,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:22,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:22,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:22,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:22,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:22,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:22,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {4470#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet3; {4470#true} is VALID [2018-11-14 18:51:22,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {4470#true} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {4470#true} is VALID [2018-11-14 18:51:22,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {4470#true} assume !(~i~1 < 5); {4470#true} is VALID [2018-11-14 18:51:22,224 INFO L256 TraceCheckUtils]: 23: Hoare triple {4470#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 18:51:22,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {4470#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4470#true} is VALID [2018-11-14 18:51:22,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,227 INFO L273 TraceCheckUtils]: 41: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 18:51:22,227 INFO L273 TraceCheckUtils]: 42: Hoare triple {4470#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 18:51:22,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,227 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4470#true} {4470#true} #73#return; {4470#true} is VALID [2018-11-14 18:51:22,228 INFO L273 TraceCheckUtils]: 45: Hoare triple {4470#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4470#true} is VALID [2018-11-14 18:51:22,228 INFO L256 TraceCheckUtils]: 46: Hoare triple {4470#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 18:51:22,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {4470#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4470#true} is VALID [2018-11-14 18:51:22,228 INFO L273 TraceCheckUtils]: 48: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,228 INFO L273 TraceCheckUtils]: 49: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,230 INFO L273 TraceCheckUtils]: 56: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,230 INFO L273 TraceCheckUtils]: 57: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,230 INFO L273 TraceCheckUtils]: 58: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,230 INFO L273 TraceCheckUtils]: 59: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,231 INFO L273 TraceCheckUtils]: 60: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {4470#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4470#true} is VALID [2018-11-14 18:51:22,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {4470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4470#true} is VALID [2018-11-14 18:51:22,231 INFO L273 TraceCheckUtils]: 63: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,231 INFO L273 TraceCheckUtils]: 64: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 18:51:22,232 INFO L273 TraceCheckUtils]: 65: Hoare triple {4470#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 18:51:22,232 INFO L273 TraceCheckUtils]: 66: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 18:51:22,232 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4470#true} {4470#true} #75#return; {4470#true} is VALID [2018-11-14 18:51:22,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {4470#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4683#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:22,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {4683#(<= main_~i~2 0)} assume true; {4683#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:22,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {4683#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4683#(<= main_~i~2 0)} is VALID [2018-11-14 18:51:22,250 INFO L273 TraceCheckUtils]: 71: Hoare triple {4683#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:22,250 INFO L273 TraceCheckUtils]: 72: Hoare triple {4473#(<= main_~i~2 1)} assume true; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:22,253 INFO L273 TraceCheckUtils]: 73: Hoare triple {4473#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 18:51:22,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {4473#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:22,255 INFO L273 TraceCheckUtils]: 75: Hoare triple {4474#(<= main_~i~2 2)} assume true; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:22,255 INFO L273 TraceCheckUtils]: 76: Hoare triple {4474#(<= main_~i~2 2)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem10; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 18:51:22,257 INFO L273 TraceCheckUtils]: 77: Hoare triple {4474#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := #t~post9 + 1;havoc #t~post9; {4475#(<= main_~i~2 3)} is VALID [2018-11-14 18:51:22,257 INFO L273 TraceCheckUtils]: 78: Hoare triple {4475#(<= main_~i~2 3)} assume true; {4475#(<= main_~i~2 3)} is VALID [2018-11-14 18:51:22,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {4475#(<= main_~i~2 3)} assume !(~i~2 < 4); {4471#false} is VALID [2018-11-14 18:51:22,258 INFO L273 TraceCheckUtils]: 80: Hoare triple {4471#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 16, 4); {4471#false} is VALID [2018-11-14 18:51:22,258 INFO L256 TraceCheckUtils]: 81: Hoare triple {4471#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4471#false} is VALID [2018-11-14 18:51:22,258 INFO L273 TraceCheckUtils]: 82: Hoare triple {4471#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4471#false} is VALID [2018-11-14 18:51:22,258 INFO L273 TraceCheckUtils]: 83: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,258 INFO L273 TraceCheckUtils]: 84: Hoare triple {4471#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4471#false} is VALID [2018-11-14 18:51:22,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {4471#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4471#false} is VALID [2018-11-14 18:51:22,259 INFO L273 TraceCheckUtils]: 86: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,259 INFO L273 TraceCheckUtils]: 87: Hoare triple {4471#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4471#false} is VALID [2018-11-14 18:51:22,259 INFO L273 TraceCheckUtils]: 88: Hoare triple {4471#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4471#false} is VALID [2018-11-14 18:51:22,259 INFO L273 TraceCheckUtils]: 89: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,259 INFO L273 TraceCheckUtils]: 90: Hoare triple {4471#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4471#false} is VALID [2018-11-14 18:51:22,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {4471#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4471#false} is VALID [2018-11-14 18:51:22,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {4471#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4471#false} is VALID [2018-11-14 18:51:22,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {4471#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4471#false} is VALID [2018-11-14 18:51:22,260 INFO L273 TraceCheckUtils]: 95: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,260 INFO L273 TraceCheckUtils]: 96: Hoare triple {4471#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4471#false} is VALID [2018-11-14 18:51:22,261 INFO L273 TraceCheckUtils]: 97: Hoare triple {4471#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4471#false} is VALID [2018-11-14 18:51:22,261 INFO L273 TraceCheckUtils]: 98: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {4471#false} assume !(~i~0 < 5); {4471#false} is VALID [2018-11-14 18:51:22,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {4471#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4471#false} is VALID [2018-11-14 18:51:22,261 INFO L273 TraceCheckUtils]: 101: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 18:51:22,261 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {4471#false} {4471#false} #77#return; {4471#false} is VALID [2018-11-14 18:51:22,262 INFO L273 TraceCheckUtils]: 103: Hoare triple {4471#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4471#false} is VALID [2018-11-14 18:51:22,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {4471#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4471#false} is VALID [2018-11-14 18:51:22,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {4471#false} assume !false; {4471#false} is VALID [2018-11-14 18:51:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-14 18:51:22,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:51:22,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:51:22,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-14 18:51:22,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:22,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:51:22,348 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-14 18:51:22,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:51:22,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:51:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:51:22,349 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-11-14 18:51:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:22,541 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-14 18:51:22,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:51:22,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-14 18:51:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:51:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 18:51:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:51:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 18:51:22,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 18:51:22,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:22,635 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:51:22,635 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 18:51:22,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:51:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 18:51:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-14 18:51:22,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:22,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-14 18:51:22,659 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 18:51:22,659 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 18:51:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:22,661 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 18:51:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:51:22,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:22,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:22,662 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 18:51:22,662 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 18:51:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:22,664 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 18:51:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:51:22,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:22,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:22,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:22,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:51:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 18:51:22,667 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 106 [2018-11-14 18:51:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:22,668 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 18:51:22,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:51:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:51:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 18:51:22,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:22,670 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 6, 5, 5, 5, 4, 4, 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-14 18:51:22,670 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:22,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2063044767, now seen corresponding path program 9 times [2018-11-14 18:51:22,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:22,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:22,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:22,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:51:22,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat