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.epf -i ../../../trunk/examples/svcomp/reducercommutativity/avg05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:01:57,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:01:57,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:01:57,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:01:57,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:01:57,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:01:57,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:01:57,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:01:57,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:01:57,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:01:57,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:01:57,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:01:57,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:01:57,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:01:57,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:01:57,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:01:57,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:01:57,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:01:57,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:01:57,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:01:57,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:01:57,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:01:57,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:01:57,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:01:57,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:01:57,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:01:57,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:01:57,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:01:57,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:01:57,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:01:57,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:01:57,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:01:57,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:01:57,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:01:57,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:01:57,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:01:57,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:01:57,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:01:57,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:01:57,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:01:57,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:01:57,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:01:57,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:01:57,268 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:01:57,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:01:57,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:01:57,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:01:57,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:01:57,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:01:57,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:01:57,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:01:57,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:01:57,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:01:57,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:01:57,271 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:01:57,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:01:57,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:01:57,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:01:57,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:01:57,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:01:57,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:01:57,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:01:57,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:01:57,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:01:57,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:01:57,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:01:57,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:01:57,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:01:57,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:01:57,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:01:57,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:01:57,350 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:01:57,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-14 17:01:57,432 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388afcd28/38e8a088afb640f197f66354e43e2e5b/FLAGc0ccb1ae1 [2018-11-14 17:01:58,009 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:01:58,011 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-14 17:01:58,018 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388afcd28/38e8a088afb640f197f66354e43e2e5b/FLAGc0ccb1ae1 [2018-11-14 17:01:58,044 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388afcd28/38e8a088afb640f197f66354e43e2e5b [2018-11-14 17:01:58,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:01:58,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:01:58,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:01:58,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:01:58,065 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:01:58,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c474f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58, skipping insertion in model container [2018-11-14 17:01:58,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:01:58,115 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:01:58,386 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:01:58,405 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:01:58,452 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:01:58,480 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:01:58,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58 WrapperNode [2018-11-14 17:01:58,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:01:58,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:01:58,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:01:58,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:01:58,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (1/1) ... [2018-11-14 17:01:58,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:01:58,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:01:58,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:01:58,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:01:58,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (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 17:01:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:01:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:01:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2018-11-14 17:01:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:01:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:01:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:01:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2018-11-14 17:01:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:01:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:01:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:01:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:01:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:01:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:01:58,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:01:58,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:01:59,538 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:01:59,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:59 BoogieIcfgContainer [2018-11-14 17:01:59,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:01:59,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:01:59,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:01:59,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:01:59,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:01:58" (1/3) ... [2018-11-14 17:01:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ee40ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:01:59, skipping insertion in model container [2018-11-14 17:01:59,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:58" (2/3) ... [2018-11-14 17:01:59,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ee40ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:01:59, skipping insertion in model container [2018-11-14 17:01:59,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:59" (3/3) ... [2018-11-14 17:01:59,550 INFO L112 eAbstractionObserver]: Analyzing ICFG avg05_true-unreach-call_true-termination.i [2018-11-14 17:01:59,562 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:01:59,574 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:01:59,594 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:01:59,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:01:59,648 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:01:59,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:01:59,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:01:59,649 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:01:59,650 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:01:59,650 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:01:59,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:01:59,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:01:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:01:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:01:59,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:01:59,695 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 17:01:59,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:01:59,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:01:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 17:01:59,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:01:59,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:01:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:01:59,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:01:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:01:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:01:59,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:01:59,978 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 17:01:59,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:01:59,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:01:59,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret12 := main(); {37#true} is VALID [2018-11-14 17:01:59,980 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 17:01:59,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:01:59,982 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:01:59,983 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 17:01:59,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:01:59,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:01:59,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:01:59,984 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:01:59,984 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 17:01:59,985 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:01:59,985 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 17:01:59,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:01:59,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:01:59,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:01:59,986 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:01:59,987 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 17:01:59,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:01:59,987 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 17:01:59,988 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:01:59,988 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 17:01:59,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:01:59,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:01:59,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:01:59,989 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:01:59,990 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 17:01:59,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {38#false} is VALID [2018-11-14 17:01:59,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:01:59,997 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 17:02:00,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:02:00,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:02:00,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:02:00,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:00,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:02:00,266 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 17:02:00,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:02:00,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:02:00,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:02:00,280 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:02:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:00,468 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:02:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:02:00,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:02:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:02:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:02:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:02:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:02:00,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:02:00,799 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 17:02:00,813 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:02:00,814 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:02:00,819 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 17:02:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:02:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:02:00,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:00,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:02:00,882 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:02:00,882 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:02:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:00,890 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:02:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:02:00,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:00,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:00,892 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:02:00,892 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:02:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:00,897 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:02:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:02:00,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:00,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:00,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:00,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:02:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:02:00,906 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:02:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:00,906 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:02:00,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:02:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:02:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:02:00,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:00,909 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 17:02:00,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:00,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 17:02:00,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:00,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:01,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 17:02:01,040 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 17:02:01,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 17:02:01,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret12 := main(); {215#true} is VALID [2018-11-14 17:02:01,042 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 17:02:01,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:02:01,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 5); {216#false} is VALID [2018-11-14 17:02:01,044 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:02:01,045 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 17:02:01,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 5); {215#true} is VALID [2018-11-14 17:02:01,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:02:01,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,047 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 17:02:01,047 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 17:02:01,047 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:02:01,048 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 17:02:01,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 5); {215#true} is VALID [2018-11-14 17:02:01,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {215#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:02:01,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,049 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 17:02:01,050 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 17:02:01,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 17:02:01,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 4); {216#false} is VALID [2018-11-14 17:02:01,051 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 17:02:01,051 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:02:01,051 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 17:02:01,052 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 5); {215#true} is VALID [2018-11-14 17:02:01,052 INFO L273 TraceCheckUtils]: 31: Hoare triple {215#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:02:01,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:02:01,053 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 17:02:01,053 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 17:02:01,054 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {216#false} is VALID [2018-11-14 17:02:01,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 17:02:01,057 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 17:02:01,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:02:01,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:02:01,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:02:01,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:01,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:02:01,153 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 17:02:01,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:02:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:02:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:02:01,155 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:02:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:01,767 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:02:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:02:01,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:02:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:02:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:02:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:02:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:02:01,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:02:01,967 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 17:02:01,970 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:02:01,970 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:02:01,972 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 17:02:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:02:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:02:01,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:01,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:02:01,989 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:02:01,990 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:02:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:01,994 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:02:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:02:01,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:01,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:01,995 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:02:01,995 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:02:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:01,999 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:02:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:02:02,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:02,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:02,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:02,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:02:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:02:02,004 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:02:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:02,004 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:02:02,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:02:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:02:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:02:02,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:02,007 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 17:02:02,007 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:02,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 17:02:02,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:02,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:02,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:02,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:02:02,107 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 17:02:02,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:02:02,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret12 := main(); {397#true} is VALID [2018-11-14 17:02:02,108 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 17:02:02,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,109 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 17:02:02,109 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 17:02:02,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 5); {397#true} is VALID [2018-11-14 17:02:02,110 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:02:02,112 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#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:02,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= avg_~i~0 0)} assume true; {399#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:02,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= avg_~i~0 0)} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 17:02:02,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:02:02,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,115 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:02:02,116 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 17:02:02,116 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:02:02,116 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 17:02:02,117 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 5); {397#true} is VALID [2018-11-14 17:02:02,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {397#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 17:02:02,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,118 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:02:02,119 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 17:02:02,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 4); {398#false} is VALID [2018-11-14 17:02:02,120 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 17:02:02,120 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:02:02,120 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 17:02:02,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 5); {397#true} is VALID [2018-11-14 17:02:02,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {397#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 17:02:02,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,122 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:02:02,122 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 17:02:02,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {398#false} is VALID [2018-11-14 17:02:02,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:02:02,126 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 17:02:02,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:02,127 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 17:02:02,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:02,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:02,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:02:02,394 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 17:02:02,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:02:02,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret12 := main(); {397#true} is VALID [2018-11-14 17:02:02,396 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 17:02:02,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,397 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 17:02:02,397 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 17:02:02,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:02:02,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 5); {397#true} is VALID [2018-11-14 17:02:02,398 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:02:02,413 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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:02,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= avg_~i~0 0)} assume true; {439#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:02,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= avg_~i~0 0)} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 17:02:02,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:02:02,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,417 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:02:02,417 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 17:02:02,418 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:02:02,418 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 17:02:02,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 17:02:02,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:02:02,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,419 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:02:02,420 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 17:02:02,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 4); {398#false} is VALID [2018-11-14 17:02:02,421 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 17:02:02,421 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:02:02,421 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 17:02:02,421 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,422 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 5); {398#false} is VALID [2018-11-14 17:02:02,422 INFO L273 TraceCheckUtils]: 34: Hoare triple {398#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:02:02,422 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:02:02,423 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:02:02,423 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 17:02:02,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {398#false} is VALID [2018-11-14 17:02:02,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:02:02,426 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 17:02:02,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:02:02,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 17:02:02,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:02:02,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:02,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:02:02,670 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 17:02:02,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:02:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:02:02,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:02:02,671 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:02:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:02,871 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:02:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:02:02,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:02:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:02:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:02:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:02:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:02:02,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:02:03,017 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 17:02:03,021 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:02:03,021 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:02:03,022 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 17:02:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:02:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:02:03,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:03,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:02:03,055 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:02:03,056 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:02:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:03,060 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:02:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:02:03,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:03,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:03,061 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:02:03,061 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:02:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:03,065 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:02:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:02:03,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:03,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:03,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:03,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:02:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:02:03,069 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 17:02:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:03,070 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:02:03,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:02:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:02:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:02:03,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:03,072 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 17:02:03,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:03,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:03,073 INFO L82 PathProgramCache]: Analyzing trace with hash 841579359, now seen corresponding path program 1 times [2018-11-14 17:02:03,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:03,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:03,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:03,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 17:02:03,225 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 17:02:03,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 17:02:03,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret12 := main(); {705#true} is VALID [2018-11-14 17:02:03,226 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 17:02:03,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,226 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 17:02:03,227 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 17:02:03,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 5); {705#true} is VALID [2018-11-14 17:02:03,228 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:02:03,228 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 17:02:03,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,229 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 17:02:03,229 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 17:02:03,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 5); {705#true} is VALID [2018-11-14 17:02:03,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:02:03,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,230 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 17:02:03,231 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 17:02:03,231 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:02:03,231 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 17:02:03,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,232 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 17:02:03,232 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 17:02:03,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 5); {705#true} is VALID [2018-11-14 17:02:03,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {705#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:02:03,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,234 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 17:02:03,237 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 17:02:03,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:02:03,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 4); {706#false} is VALID [2018-11-14 17:02:03,240 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 17:02:03,240 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:02:03,240 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 17:02:03,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,241 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 17:02:03,241 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 17:02:03,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,241 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 5); {705#true} is VALID [2018-11-14 17:02:03,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {705#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:02:03,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:02:03,242 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 17:02:03,243 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 17:02:03,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {706#false} is VALID [2018-11-14 17:02:03,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 17:02:03,247 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 17:02:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:02:03,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:02:03,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:02:03,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:03,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:02:03,329 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 17:02:03,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:02:03,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:02:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:02:03,331 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 17:02:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:03,450 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:02:03,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:02:03,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:02:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:02:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:02:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:02:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:02:03,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:02:03,602 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 17:02:03,604 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:02:03,604 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:02:03,605 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 17:02:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:02:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 17:02:03,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:03,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 17:02:03,621 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 17:02:03,621 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 17:02:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:03,624 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:02:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:02:03,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:03,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:03,628 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 17:02:03,628 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 17:02:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:03,631 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:02:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:02:03,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:03,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:03,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:03,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:02:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:02:03,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 17:02:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:03,636 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:02:03,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:02:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:02:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:02:03,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:03,638 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 17:02:03,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:03,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash 611709709, now seen corresponding path program 1 times [2018-11-14 17:02:03,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:03,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:03,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:02:03,760 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 17:02:03,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:02:03,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret12 := main(); {900#true} is VALID [2018-11-14 17:02:03,769 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 17:02:03,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:02:03,771 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 17:02:03,771 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 17:02:03,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:02:03,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 5); {901#false} is VALID [2018-11-14 17:02:03,774 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:02:03,774 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 17:02:03,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,775 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 17:02:03,775 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 17:02:03,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 5); {900#true} is VALID [2018-11-14 17:02:03,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:02:03,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,777 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:02:03,777 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 17:02:03,777 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:02:03,777 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 17:02:03,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,778 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 17:02:03,778 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 17:02:03,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 5); {900#true} is VALID [2018-11-14 17:02:03,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {900#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:02:03,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,779 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:02:03,780 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 17:02:03,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:03,780 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 17:02:03,781 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 17:02:03,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:03,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 4); {901#false} is VALID [2018-11-14 17:02:03,781 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 17:02:03,782 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:02:03,782 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 17:02:03,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,782 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 17:02:03,783 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 17:02:03,783 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,783 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 5); {900#true} is VALID [2018-11-14 17:02:03,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {900#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:02:03,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:03,783 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:02:03,784 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 17:02:03,784 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {901#false} is VALID [2018-11-14 17:02:03,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:02:03,787 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 17:02:03,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:03,788 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 17:02:03,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:03,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:04,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:02:04,177 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 17:02:04,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:02:04,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:02:04,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret12 := main(); {900#true} is VALID [2018-11-14 17:02:04,179 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 17:02:04,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:02:04,181 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 17:02:04,182 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 17:02:04,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:02:04,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 5); {901#false} is VALID [2018-11-14 17:02:04,184 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:02:04,185 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 17:02:04,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,186 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 17:02:04,186 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 17:02:04,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 5); {901#false} is VALID [2018-11-14 17:02:04,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:02:04,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,188 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:02:04,188 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 17:02:04,189 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:02:04,189 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 17:02:04,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,190 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 17:02:04,190 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 17:02:04,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,190 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 5); {901#false} is VALID [2018-11-14 17:02:04,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:02:04,191 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,191 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:02:04,192 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 17:02:04,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,192 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 17:02:04,192 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 17:02:04,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 4); {901#false} is VALID [2018-11-14 17:02:04,193 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 17:02:04,193 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:02:04,193 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 17:02:04,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,194 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 17:02:04,194 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 17:02:04,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,194 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 5); {901#false} is VALID [2018-11-14 17:02:04,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {901#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:02:04,195 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:02:04,195 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:02:04,196 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 17:02:04,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {901#false} is VALID [2018-11-14 17:02:04,196 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:02:04,199 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 17:02:04,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:04,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:02:04,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:02:04,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:04,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:02:04,310 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 17:02:04,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:02:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:02:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:02:04,311 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 17:02:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:04,680 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 17:02:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:02:04,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:02:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:02:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:02:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:02:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:02:04,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 17:02:04,852 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 17:02:04,854 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:02:04,854 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:02:04,855 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 17:02:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:02:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:02:04,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:04,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:02:04,868 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:02:04,869 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:02:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:04,872 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:02:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:02:04,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:04,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:04,873 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:02:04,873 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:02:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:04,876 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:02:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:02:04,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:04,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:04,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:04,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:02:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:02:04,881 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 17:02:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:02:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:02:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:02:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:02:04,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:04,883 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 17:02:04,883 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:04,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash -349935993, now seen corresponding path program 2 times [2018-11-14 17:02:04,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:04,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:04,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:04,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:05,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:02:05,082 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 17:02:05,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:02:05,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret12 := main(); {1277#true} is VALID [2018-11-14 17:02:05,084 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 17:02:05,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:02:05,086 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 17:02:05,087 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 17:02:05,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:02:05,087 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 17:02:05,088 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 17:02:05,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:02:05,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 5); {1278#false} is VALID [2018-11-14 17:02:05,091 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:02:05,091 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 17:02:05,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,092 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 17:02:05,092 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 17:02:05,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 5); {1277#true} is VALID [2018-11-14 17:02:05,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:02:05,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,094 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:02:05,094 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 17:02:05,094 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:02:05,095 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 17:02:05,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,095 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 17:02:05,095 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 17:02:05,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 5); {1277#true} is VALID [2018-11-14 17:02:05,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:02:05,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,096 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:02:05,097 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 17:02:05,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,097 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 17:02:05,097 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 17:02:05,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 4); {1278#false} is VALID [2018-11-14 17:02:05,098 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 17:02:05,098 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:02:05,098 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 17:02:05,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,099 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 17:02:05,099 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 17:02:05,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 5); {1277#true} is VALID [2018-11-14 17:02:05,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:02:05,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,100 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:02:05,100 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 17:02:05,100 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:02:05,100 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:02:05,104 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 17:02:05,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:05,104 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 17:02:05,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:02:05,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:02:05,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:02:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:05,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:05,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:02:05,361 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 17:02:05,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:02:05,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:02:05,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret12 := main(); {1277#true} is VALID [2018-11-14 17:02:05,370 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 17:02:05,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:02:05,371 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 17:02:05,372 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 17:02:05,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:02:05,373 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 17:02:05,373 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 17:02:05,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:02:05,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 5); {1278#false} is VALID [2018-11-14 17:02:05,375 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:02:05,376 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 17:02:05,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,376 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 17:02:05,377 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 17:02:05,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 5); {1278#false} is VALID [2018-11-14 17:02:05,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:02:05,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,379 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:02:05,379 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 17:02:05,379 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:02:05,380 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 17:02:05,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,380 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 17:02:05,380 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 17:02:05,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 5); {1278#false} is VALID [2018-11-14 17:02:05,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {1278#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:02:05,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,382 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:02:05,382 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 17:02:05,382 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,382 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 17:02:05,383 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 17:02:05,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,383 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 4); {1278#false} is VALID [2018-11-14 17:02:05,383 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 17:02:05,384 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:02:05,384 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 17:02:05,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,384 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 17:02:05,385 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 17:02:05,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,385 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 5); {1278#false} is VALID [2018-11-14 17:02:05,385 INFO L273 TraceCheckUtils]: 49: Hoare triple {1278#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:02:05,386 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:02:05,386 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:02:05,386 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 17:02:05,386 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:02:05,387 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:02:05,390 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 17:02:05,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:05,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:02:05,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:02:05,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:05,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:02:05,481 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 17:02:05,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:02:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:02:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:02:05,482 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 17:02:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:05,694 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 17:02:05,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:02:05,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:02:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:02:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:02:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:02:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:02:05,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 17:02:05,874 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 17:02:05,876 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:02:05,876 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:02:05,877 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 17:02:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:02:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 17:02:05,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:05,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 17:02:05,904 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 17:02:05,904 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 17:02:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:05,907 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:02:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:02:05,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:05,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:05,908 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 17:02:05,908 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 17:02:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:05,910 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:02:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:02:05,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:05,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:05,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:05,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:02:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 17:02:05,914 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 17:02:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:05,914 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 17:02:05,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:02:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 17:02:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:02:05,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:05,916 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 17:02:05,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:05,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1305179955, now seen corresponding path program 3 times [2018-11-14 17:02:05,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:05,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:02:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:06,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:02:06,594 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 17:02:06,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:02:06,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret12 := main(); {1678#true} is VALID [2018-11-14 17:02:06,600 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 17:02:06,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:02:06,601 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 17:02:06,602 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 17:02:06,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:02:06,603 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 17:02:06,604 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 17:02:06,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:02:06,605 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 17:02:06,606 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 17:02:06,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 17:02:06,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 5); {1679#false} is VALID [2018-11-14 17:02:06,608 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:02:06,609 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 17:02:06,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,609 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 17:02:06,609 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 17:02:06,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 17:02:06,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:02:06,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,611 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 17:02:06,611 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 17:02:06,612 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:02:06,612 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 17:02:06,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,612 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 17:02:06,613 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 17:02:06,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 17:02:06,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:02:06,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,613 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 17:02:06,614 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 17:02:06,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:02:06,614 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 17:02:06,614 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 17:02:06,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:02:06,614 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 4); {1679#false} is VALID [2018-11-14 17:02:06,615 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 17:02:06,615 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:02:06,615 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 17:02:06,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,615 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 17:02:06,616 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 17:02:06,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 17:02:06,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {1678#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:02:06,617 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,617 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 17:02:06,617 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 17:02:06,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:02:06,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:02:06,622 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 17:02:06,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:06,622 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 17:02:06,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:02:06,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:02:06,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:02:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:06,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:06,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:02:06,855 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 17:02:06,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:02:06,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret12 := main(); {1678#true} is VALID [2018-11-14 17:02:06,857 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 17:02:06,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,857 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 17:02:06,858 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 17:02:06,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,858 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 17:02:06,858 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 17:02:06,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,859 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 17:02:06,859 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 17:02:06,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 5); {1678#true} is VALID [2018-11-14 17:02:06,859 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:02:06,859 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 17:02:06,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,860 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 17:02:06,860 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 17:02:06,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 17:02:06,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:02:06,861 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,861 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 17:02:06,861 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 17:02:06,861 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:02:06,861 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 17:02:06,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,862 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 17:02:06,862 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 17:02:06,862 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 5); {1678#true} is VALID [2018-11-14 17:02:06,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:02:06,863 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,863 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 17:02:06,863 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 17:02:06,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,863 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 17:02:06,864 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 17:02:06,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:02:06,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 4); {1678#true} is VALID [2018-11-14 17:02:06,865 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 17:02:06,865 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:02:06,878 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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:06,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= avg_~i~0 0)} assume true; {1825#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:06,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= avg_~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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:06,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1835#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:06,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= avg_~i~0 1)} assume true; {1835#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:06,882 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= avg_~i~0 1)} assume !(~i~0 < 5); {1679#false} is VALID [2018-11-14 17:02:06,882 INFO L273 TraceCheckUtils]: 52: Hoare triple {1679#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {1679#false} is VALID [2018-11-14 17:02:06,882 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:02:06,883 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 17:02:06,883 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 17:02:06,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:02:06,884 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:02:06,889 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 17:02:06,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:06,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 17:02:06,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:02:06,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:06,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:02:07,071 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 17:02:07,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:02:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:02:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:02:07,072 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 17:02:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:07,472 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 17:02:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:02:07,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:02:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:02:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:02:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:02:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:02:07,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 17:02:07,610 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 17:02:07,612 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:02:07,613 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:02:07,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:02:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:02:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 17:02:07,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:07,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 17:02:07,644 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 17:02:07,644 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 17:02:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:07,647 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:02:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:02:07,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:07,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:07,648 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 17:02:07,648 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 17:02:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:07,651 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:02:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:02:07,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:07,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:07,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:07,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:02:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:02:07,655 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 17:02:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:07,655 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:02:07,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:02:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:02:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:02:07,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:07,657 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 17:02:07,657 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:07,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 375282389, now seen corresponding path program 4 times [2018-11-14 17:02:07,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:07,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:02:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:08,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:02:08,058 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 17:02:08,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:02:08,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret12 := main(); {2121#true} is VALID [2018-11-14 17:02:08,060 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 17:02:08,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:02:08,061 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 17:02:08,061 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 17:02:08,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:02:08,062 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 17:02:08,063 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 17:02:08,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:02:08,066 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 17:02:08,067 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 17:02:08,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:02:08,068 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 17:02:08,068 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 17:02:08,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:02:08,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 5); {2122#false} is VALID [2018-11-14 17:02:08,070 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:02:08,070 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 17:02:08,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,071 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 17:02:08,071 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 17:02:08,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,072 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 17:02:08,072 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 17:02:08,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 5); {2121#true} is VALID [2018-11-14 17:02:08,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:02:08,073 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,073 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:02:08,074 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 17:02:08,074 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:02:08,074 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 17:02:08,074 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,075 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 17:02:08,075 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 17:02:08,075 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,075 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 17:02:08,076 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 17:02:08,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 5); {2121#true} is VALID [2018-11-14 17:02:08,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {2121#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:02:08,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,077 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:02:08,077 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 17:02:08,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,077 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 17:02:08,078 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 17:02:08,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 4); {2122#false} is VALID [2018-11-14 17:02:08,078 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 17:02:08,079 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:02:08,079 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 17:02:08,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,079 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 17:02:08,079 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 17:02:08,080 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,080 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 17:02:08,080 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 17:02:08,080 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 5); {2121#true} is VALID [2018-11-14 17:02:08,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {2121#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:02:08,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,081 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:02:08,081 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 17:02:08,081 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:02:08,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:02:08,086 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 17:02:08,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:08,087 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 17:02:08,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:02:08,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:02:08,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:02:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:08,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:08,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:02:08,328 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 17:02:08,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:02:08,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret12 := main(); {2121#true} is VALID [2018-11-14 17:02:08,329 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 17:02:08,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,330 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 17:02:08,330 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 17:02:08,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,330 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 17:02:08,330 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 17:02:08,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,331 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 17:02:08,331 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 17:02:08,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,331 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 17:02:08,331 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 17:02:08,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:02:08,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {2121#true} assume !(~i~1 < 5); {2121#true} is VALID [2018-11-14 17:02:08,331 INFO L256 TraceCheckUtils]: 20: Hoare triple {2121#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:02:08,332 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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:08,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {2194#(<= avg_~i~0 0)} assume true; {2194#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:08,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {2194#(<= avg_~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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:08,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {2194#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2204#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:08,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {2204#(<= avg_~i~0 1)} assume true; {2204#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:08,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {2204#(<= avg_~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#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:08,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {2204#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2214#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:08,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {2214#(<= avg_~i~0 2)} assume true; {2214#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:08,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {2214#(<= avg_~i~0 2)} assume !(~i~0 < 5); {2122#false} is VALID [2018-11-14 17:02:08,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {2122#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:02:08,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,337 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2121#true} #73#return; {2122#false} is VALID [2018-11-14 17:02:08,337 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 17:02:08,337 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:02:08,337 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 17:02:08,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,338 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 17:02:08,338 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 17:02:08,338 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,339 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 17:02:08,339 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 17:02:08,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 5); {2122#false} is VALID [2018-11-14 17:02:08,339 INFO L273 TraceCheckUtils]: 44: Hoare triple {2122#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:02:08,340 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,340 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:02:08,340 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 17:02:08,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,340 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 17:02:08,340 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 17:02:08,340 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 4); {2122#false} is VALID [2018-11-14 17:02:08,341 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 17:02:08,341 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:02:08,341 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 17:02:08,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,341 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 17:02:08,341 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 17:02:08,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,342 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 17:02:08,342 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 17:02:08,342 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,342 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 5); {2122#false} is VALID [2018-11-14 17:02:08,343 INFO L273 TraceCheckUtils]: 64: Hoare triple {2122#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:02:08,343 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:02:08,343 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:02:08,343 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 17:02:08,343 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:02:08,344 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:02:08,346 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 17:02:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:08,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-14 17:02:08,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-11-14 17:02:08,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:08,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:02:08,523 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 17:02:08,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:02:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:02:08,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:02:08,524 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2018-11-14 17:02:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:09,008 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-14 17:02:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:02:09,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-11-14 17:02:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:02:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-14 17:02:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:02:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-14 17:02:09,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2018-11-14 17:02:09,121 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 17:02:09,123 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:02:09,124 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:02:09,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:02:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:02:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-14 17:02:09,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:09,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-14 17:02:09,152 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-14 17:02:09,152 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-14 17:02:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:09,156 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 17:02:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:02:09,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:09,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:09,157 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-14 17:02:09,157 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-14 17:02:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:09,159 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 17:02:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:02:09,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:09,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:09,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:09,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:02:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-14 17:02:09,163 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 70 [2018-11-14 17:02:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:09,163 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-14 17:02:09,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:02:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-14 17:02:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 17:02:09,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:09,164 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 17:02:09,165 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:09,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 15771597, now seen corresponding path program 5 times [2018-11-14 17:02:09,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:09,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:09,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:02:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:09,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2631#true} is VALID [2018-11-14 17:02:09,385 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 17:02:09,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2631#true} {2631#true} #69#return; {2631#true} is VALID [2018-11-14 17:02:09,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2018-11-14 17:02:09,386 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 17:02:09,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,386 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 17:02:09,387 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 17:02:09,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,387 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 17:02:09,387 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 17:02:09,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,388 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 17:02:09,388 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 17:02:09,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,388 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 17:02:09,388 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 17:02:09,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,388 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 17:02:09,389 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 17:02:09,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {2631#true} assume !(~i~1 < 5); {2631#true} is VALID [2018-11-14 17:02:09,389 INFO L256 TraceCheckUtils]: 23: Hoare triple {2631#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 17:02:09,389 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#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:09,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {2633#(= avg_~i~0 0)} assume true; {2633#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:09,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {2633#(= avg_~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#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:09,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {2633#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2634#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:09,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {2634#(<= avg_~i~0 1)} assume true; {2634#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:09,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {2634#(<= avg_~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#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:09,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {2634#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2635#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:09,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#(<= avg_~i~0 2)} assume true; {2635#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:09,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {2635#(<= avg_~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#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:09,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2636#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:09,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {2636#(<= avg_~i~0 3)} assume true; {2636#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:09,395 INFO L273 TraceCheckUtils]: 35: Hoare triple {2636#(<= avg_~i~0 3)} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 17:02:09,395 INFO L273 TraceCheckUtils]: 36: Hoare triple {2632#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 17:02:09,395 INFO L273 TraceCheckUtils]: 37: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,396 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2632#false} {2631#true} #73#return; {2632#false} is VALID [2018-11-14 17:02:09,396 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 17:02:09,396 INFO L256 TraceCheckUtils]: 40: Hoare triple {2632#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 17:02:09,396 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 17:02:09,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,397 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 17:02:09,397 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 17:02:09,397 INFO L273 TraceCheckUtils]: 45: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,397 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 17:02:09,398 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 17:02:09,398 INFO L273 TraceCheckUtils]: 48: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,398 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 17:02:09,398 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 17:02:09,398 INFO L273 TraceCheckUtils]: 51: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,398 INFO L273 TraceCheckUtils]: 52: Hoare triple {2631#true} assume !(~i~0 < 5); {2631#true} is VALID [2018-11-14 17:02:09,398 INFO L273 TraceCheckUtils]: 53: Hoare triple {2631#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2631#true} is VALID [2018-11-14 17:02:09,399 INFO L273 TraceCheckUtils]: 54: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,399 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2631#true} {2632#false} #75#return; {2632#false} is VALID [2018-11-14 17:02:09,399 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 17:02:09,399 INFO L273 TraceCheckUtils]: 57: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,399 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 17:02:09,399 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 17:02:09,399 INFO L273 TraceCheckUtils]: 60: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,399 INFO L273 TraceCheckUtils]: 61: Hoare triple {2632#false} assume !(~i~2 < 4); {2632#false} is VALID [2018-11-14 17:02:09,400 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 17:02:09,400 INFO L256 TraceCheckUtils]: 63: Hoare triple {2632#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 17:02:09,400 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 17:02:09,400 INFO L273 TraceCheckUtils]: 65: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,400 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 17:02:09,400 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 17:02:09,400 INFO L273 TraceCheckUtils]: 68: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,401 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 17:02:09,401 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 17:02:09,401 INFO L273 TraceCheckUtils]: 71: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,401 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 17:02:09,401 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 17:02:09,401 INFO L273 TraceCheckUtils]: 74: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,401 INFO L273 TraceCheckUtils]: 75: Hoare triple {2631#true} assume !(~i~0 < 5); {2631#true} is VALID [2018-11-14 17:02:09,401 INFO L273 TraceCheckUtils]: 76: Hoare triple {2631#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2631#true} is VALID [2018-11-14 17:02:09,402 INFO L273 TraceCheckUtils]: 77: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,402 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2631#true} {2632#false} #77#return; {2632#false} is VALID [2018-11-14 17:02:09,402 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 17:02:09,402 INFO L273 TraceCheckUtils]: 80: Hoare triple {2632#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2632#false} is VALID [2018-11-14 17:02:09,402 INFO L273 TraceCheckUtils]: 81: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2018-11-14 17:02:09,405 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 17:02:09,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:09,406 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 17:02:09,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:02:09,470 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 17:02:09,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:02:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:09,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:09,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2631#true} is VALID [2018-11-14 17:02:09,711 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 17:02:09,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2631#true} {2631#true} #69#return; {2631#true} is VALID [2018-11-14 17:02:09,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2018-11-14 17:02:09,712 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 17:02:09,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,712 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 17:02:09,713 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 17:02:09,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,713 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 17:02:09,713 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 17:02:09,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,714 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 17:02:09,714 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 17:02:09,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,714 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 17:02:09,714 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 17:02:09,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,715 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 17:02:09,715 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 17:02:09,715 INFO L273 TraceCheckUtils]: 21: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-14 17:02:09,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {2631#true} assume !(~i~1 < 5); {2631#true} is VALID [2018-11-14 17:02:09,715 INFO L256 TraceCheckUtils]: 23: Hoare triple {2631#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2631#true} is VALID [2018-11-14 17:02:09,716 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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:09,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {2712#(<= avg_~i~0 0)} assume true; {2712#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:09,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {2712#(<= avg_~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#(<= avg_~i~0 0)} is VALID [2018-11-14 17:02:09,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {2712#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2634#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:09,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {2634#(<= avg_~i~0 1)} assume true; {2634#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:09,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {2634#(<= avg_~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#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:09,783 INFO L273 TraceCheckUtils]: 30: Hoare triple {2634#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2635#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:09,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#(<= avg_~i~0 2)} assume true; {2635#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:09,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {2635#(<= avg_~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#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:09,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2636#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:09,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {2636#(<= avg_~i~0 3)} assume true; {2636#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:09,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {2636#(<= avg_~i~0 3)} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 17:02:09,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {2632#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 17:02:09,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,802 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2632#false} {2631#true} #73#return; {2632#false} is VALID [2018-11-14 17:02:09,802 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 17:02:09,802 INFO L256 TraceCheckUtils]: 40: Hoare triple {2632#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2632#false} is VALID [2018-11-14 17:02:09,802 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 17:02:09,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,803 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 17:02:09,803 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 17:02:09,803 INFO L273 TraceCheckUtils]: 45: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,803 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 17:02:09,803 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 17:02:09,803 INFO L273 TraceCheckUtils]: 48: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,803 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 17:02:09,804 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 17:02:09,804 INFO L273 TraceCheckUtils]: 51: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {2632#false} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 17:02:09,804 INFO L273 TraceCheckUtils]: 53: Hoare triple {2632#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 17:02:09,804 INFO L273 TraceCheckUtils]: 54: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,804 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2632#false} {2632#false} #75#return; {2632#false} is VALID [2018-11-14 17:02:09,804 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 17:02:09,804 INFO L273 TraceCheckUtils]: 57: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,805 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 17:02:09,806 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 17:02:09,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,806 INFO L273 TraceCheckUtils]: 61: Hoare triple {2632#false} assume !(~i~2 < 4); {2632#false} is VALID [2018-11-14 17:02:09,806 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 17:02:09,807 INFO L256 TraceCheckUtils]: 63: Hoare triple {2632#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2632#false} is VALID [2018-11-14 17:02:09,807 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 17:02:09,807 INFO L273 TraceCheckUtils]: 65: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,807 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 17:02:09,807 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 17:02:09,807 INFO L273 TraceCheckUtils]: 68: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,808 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 17:02:09,808 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 17:02:09,808 INFO L273 TraceCheckUtils]: 71: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,808 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 17:02:09,808 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 17:02:09,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {2632#false} assume !(~i~0 < 5); {2632#false} is VALID [2018-11-14 17:02:09,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {2632#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {2632#false} is VALID [2018-11-14 17:02:09,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {2632#false} assume true; {2632#false} is VALID [2018-11-14 17:02:09,809 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2632#false} {2632#false} #77#return; {2632#false} is VALID [2018-11-14 17:02:09,810 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 17:02:09,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {2632#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2632#false} is VALID [2018-11-14 17:02:09,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2018-11-14 17:02:09,814 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 17:02:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:09,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:02:09,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-14 17:02:09,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:09,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:02:09,998 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 17:02:09,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:02:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:02:09,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:02:10,000 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-11-14 17:02:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:10,381 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 17:02:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:02:10,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-14 17:02:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:02:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:02:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:02:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:02:10,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2018-11-14 17:02:10,504 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 17:02:10,506 INFO L225 Difference]: With dead ends: 86 [2018-11-14 17:02:10,506 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:02:10,507 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:02:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:02:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-14 17:02:10,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:10,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-14 17:02:10,530 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-14 17:02:10,531 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-14 17:02:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:10,533 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 17:02:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-14 17:02:10,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:10,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:10,534 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-14 17:02:10,534 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-14 17:02:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:10,537 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 17:02:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-14 17:02:10,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:10,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:10,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:10,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:02:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 17:02:10,540 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 82 [2018-11-14 17:02:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:10,541 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 17:02:10,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:02:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:02:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 17:02:10,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:10,542 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 17:02:10,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:10,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:10,543 INFO L82 PathProgramCache]: Analyzing trace with hash -888096881, now seen corresponding path program 6 times [2018-11-14 17:02:10,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:10,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:10,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:10,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:02:10,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:10,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {3190#true} call ULTIMATE.init(); {3190#true} is VALID [2018-11-14 17:02:10,836 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 17:02:10,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3190#true} {3190#true} #69#return; {3190#true} is VALID [2018-11-14 17:02:10,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {3190#true} call #t~ret12 := main(); {3190#true} is VALID [2018-11-14 17:02:10,836 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 17:02:10,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,837 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 17:02:10,837 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 17:02:10,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,837 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 17:02:10,837 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 17:02:10,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,837 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 17:02:10,838 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 17:02:10,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,838 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 17:02:10,838 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 17:02:10,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,838 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 17:02:10,838 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 17:02:10,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {3190#true} assume !(~i~1 < 5); {3190#true} is VALID [2018-11-14 17:02:10,839 INFO L256 TraceCheckUtils]: 23: Hoare triple {3190#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 17:02:10,839 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#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:10,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {3192#(= avg_~i~0 0)} assume true; {3192#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:10,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {3192#(= avg_~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#(= avg_~i~0 0)} is VALID [2018-11-14 17:02:10,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {3192#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3193#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:10,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {3193#(<= avg_~i~0 1)} assume true; {3193#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:10,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {3193#(<= avg_~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#(<= avg_~i~0 1)} is VALID [2018-11-14 17:02:10,842 INFO L273 TraceCheckUtils]: 30: Hoare triple {3193#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3194#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:10,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#(<= avg_~i~0 2)} assume true; {3194#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:10,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#(<= avg_~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#(<= avg_~i~0 2)} is VALID [2018-11-14 17:02:10,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3195#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:10,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {3195#(<= avg_~i~0 3)} assume true; {3195#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:10,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {3195#(<= avg_~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#(<= avg_~i~0 3)} is VALID [2018-11-14 17:02:10,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {3195#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3196#(<= avg_~i~0 4)} is VALID [2018-11-14 17:02:10,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {3196#(<= avg_~i~0 4)} assume true; {3196#(<= avg_~i~0 4)} is VALID [2018-11-14 17:02:10,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {3196#(<= avg_~i~0 4)} assume !(~i~0 < 5); {3191#false} is VALID [2018-11-14 17:02:10,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {3191#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3191#false} is VALID [2018-11-14 17:02:10,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:10,847 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3191#false} {3190#true} #73#return; {3191#false} is VALID [2018-11-14 17:02:10,848 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 17:02:10,848 INFO L256 TraceCheckUtils]: 43: Hoare triple {3191#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 17:02:10,848 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 17:02:10,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,849 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 17:02:10,849 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 17:02:10,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,849 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 17:02:10,850 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 17:02:10,850 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,850 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 17:02:10,850 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 17:02:10,850 INFO L273 TraceCheckUtils]: 54: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,850 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 17:02:10,850 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 17:02:10,850 INFO L273 TraceCheckUtils]: 57: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,851 INFO L273 TraceCheckUtils]: 58: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 17:02:10,851 INFO L273 TraceCheckUtils]: 59: Hoare triple {3190#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 17:02:10,851 INFO L273 TraceCheckUtils]: 60: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,851 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3190#true} {3191#false} #75#return; {3191#false} is VALID [2018-11-14 17:02:10,851 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 17:02:10,851 INFO L273 TraceCheckUtils]: 63: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:10,851 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 17:02:10,852 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 17:02:10,852 INFO L273 TraceCheckUtils]: 66: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:10,852 INFO L273 TraceCheckUtils]: 67: Hoare triple {3191#false} assume !(~i~2 < 4); {3191#false} is VALID [2018-11-14 17:02:10,852 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 17:02:10,852 INFO L256 TraceCheckUtils]: 69: Hoare triple {3191#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 17:02:10,853 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 17:02:10,853 INFO L273 TraceCheckUtils]: 71: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,853 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 17:02:10,853 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 17:02:10,853 INFO L273 TraceCheckUtils]: 74: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,853 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 17:02:10,854 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 17:02:10,854 INFO L273 TraceCheckUtils]: 77: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,854 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 17:02:10,854 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 17:02:10,854 INFO L273 TraceCheckUtils]: 80: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,854 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 17:02:10,855 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 17:02:10,855 INFO L273 TraceCheckUtils]: 83: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,855 INFO L273 TraceCheckUtils]: 84: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 17:02:10,855 INFO L273 TraceCheckUtils]: 85: Hoare triple {3190#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 17:02:10,855 INFO L273 TraceCheckUtils]: 86: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:10,855 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3190#true} {3191#false} #77#return; {3191#false} is VALID [2018-11-14 17:02:10,856 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 17:02:10,856 INFO L273 TraceCheckUtils]: 89: Hoare triple {3191#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3191#false} is VALID [2018-11-14 17:02:10,856 INFO L273 TraceCheckUtils]: 90: Hoare triple {3191#false} assume !false; {3191#false} is VALID [2018-11-14 17:02:10,861 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 17:02:10,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:10,861 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 17:02:10,877 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:02:10,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 17:02:10,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:02:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:11,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:11,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {3190#true} call ULTIMATE.init(); {3190#true} is VALID [2018-11-14 17:02:11,158 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 17:02:11,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3190#true} {3190#true} #69#return; {3190#true} is VALID [2018-11-14 17:02:11,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {3190#true} call #t~ret12 := main(); {3190#true} is VALID [2018-11-14 17:02:11,159 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 17:02:11,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,160 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 17:02:11,160 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 17:02:11,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,160 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 17:02:11,160 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 17:02:11,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,161 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 17:02:11,161 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 17:02:11,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,161 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 17:02:11,161 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 17:02:11,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,162 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 17:02:11,162 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 17:02:11,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {3190#true} assume !(~i~1 < 5); {3190#true} is VALID [2018-11-14 17:02:11,162 INFO L256 TraceCheckUtils]: 23: Hoare triple {3190#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 17:02:11,162 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 17:02:11,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,163 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 17:02:11,163 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 17:02:11,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,163 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 17:02:11,163 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 17:02:11,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,163 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 17:02:11,163 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 17:02:11,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,164 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 17:02:11,164 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 17:02:11,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 17:02:11,164 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 17:02:11,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,164 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3190#true} {3190#true} #73#return; {3190#true} is VALID [2018-11-14 17:02:11,165 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 17:02:11,165 INFO L256 TraceCheckUtils]: 43: Hoare triple {3190#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3190#true} is VALID [2018-11-14 17:02:11,165 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 17:02:11,165 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,165 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 17:02:11,165 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 17:02:11,165 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,165 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 17:02:11,166 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 17:02:11,166 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,166 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 17:02:11,166 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 17:02:11,166 INFO L273 TraceCheckUtils]: 54: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,166 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 17:02:11,166 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 17:02:11,166 INFO L273 TraceCheckUtils]: 57: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,167 INFO L273 TraceCheckUtils]: 58: Hoare triple {3190#true} assume !(~i~0 < 5); {3190#true} is VALID [2018-11-14 17:02:11,167 INFO L273 TraceCheckUtils]: 59: Hoare triple {3190#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3190#true} is VALID [2018-11-14 17:02:11,167 INFO L273 TraceCheckUtils]: 60: Hoare triple {3190#true} assume true; {3190#true} is VALID [2018-11-14 17:02:11,167 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3190#true} {3190#true} #75#return; {3190#true} is VALID [2018-11-14 17:02:11,168 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 17:02:11,168 INFO L273 TraceCheckUtils]: 63: Hoare triple {3386#(<= main_~i~2 0)} assume true; {3386#(<= main_~i~2 0)} is VALID [2018-11-14 17:02:11,168 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 17:02:11,169 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 17:02:11,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {3396#(<= main_~i~2 1)} assume true; {3396#(<= main_~i~2 1)} is VALID [2018-11-14 17:02:11,170 INFO L273 TraceCheckUtils]: 67: Hoare triple {3396#(<= main_~i~2 1)} assume !(~i~2 < 4); {3191#false} is VALID [2018-11-14 17:02:11,170 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 17:02:11,170 INFO L256 TraceCheckUtils]: 69: Hoare triple {3191#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3191#false} is VALID [2018-11-14 17:02:11,170 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 17:02:11,170 INFO L273 TraceCheckUtils]: 71: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:11,171 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 17:02:11,171 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 17:02:11,171 INFO L273 TraceCheckUtils]: 74: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:11,171 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 17:02:11,171 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 17:02:11,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:11,172 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 17:02:11,172 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 17:02:11,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:11,172 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 17:02:11,173 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 17:02:11,173 INFO L273 TraceCheckUtils]: 83: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:11,173 INFO L273 TraceCheckUtils]: 84: Hoare triple {3191#false} assume !(~i~0 < 5); {3191#false} is VALID [2018-11-14 17:02:11,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {3191#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3191#false} is VALID [2018-11-14 17:02:11,173 INFO L273 TraceCheckUtils]: 86: Hoare triple {3191#false} assume true; {3191#false} is VALID [2018-11-14 17:02:11,174 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3191#false} {3191#false} #77#return; {3191#false} is VALID [2018-11-14 17:02:11,174 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 17:02:11,174 INFO L273 TraceCheckUtils]: 89: Hoare triple {3191#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3191#false} is VALID [2018-11-14 17:02:11,174 INFO L273 TraceCheckUtils]: 90: Hoare triple {3191#false} assume !false; {3191#false} is VALID [2018-11-14 17:02:11,178 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 17:02:11,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:11,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-11-14 17:02:11,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-14 17:02:11,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:11,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:02:11,272 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 17:02:11,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:02:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:02:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:02:11,273 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-14 17:02:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:11,711 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-11-14 17:02:11,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:02:11,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-14 17:02:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:02:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-14 17:02:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:02:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-14 17:02:11,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2018-11-14 17:02:11,800 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 17:02:11,802 INFO L225 Difference]: With dead ends: 95 [2018-11-14 17:02:11,802 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 17:02:11,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:02:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 17:02:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-14 17:02:11,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:11,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-14 17:02:11,835 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-14 17:02:11,835 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-14 17:02:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:11,837 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-14 17:02:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-14 17:02:11,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:11,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:11,838 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-14 17:02:11,838 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-14 17:02:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:11,840 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-14 17:02:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-14 17:02:11,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:11,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:11,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:11,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:02:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 17:02:11,844 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 91 [2018-11-14 17:02:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:11,844 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 17:02:11,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:02:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:02:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 17:02:11,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:11,847 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 17:02:11,847 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:11,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 822080415, now seen corresponding path program 7 times [2018-11-14 17:02:11,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:11,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:11,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:11,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:02:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:12,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {3810#true} call ULTIMATE.init(); {3810#true} is VALID [2018-11-14 17:02:12,056 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 17:02:12,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3810#true} {3810#true} #69#return; {3810#true} is VALID [2018-11-14 17:02:12,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {3810#true} call #t~ret12 := main(); {3810#true} is VALID [2018-11-14 17:02:12,056 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 17:02:12,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,057 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 17:02:12,057 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 17:02:12,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,057 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 17:02:12,057 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 17:02:12,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,057 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 17:02:12,058 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 17:02:12,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,058 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 17:02:12,058 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 17:02:12,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,058 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 17:02:12,058 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 17:02:12,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {3810#true} assume !(~i~1 < 5); {3810#true} is VALID [2018-11-14 17:02:12,059 INFO L256 TraceCheckUtils]: 23: Hoare triple {3810#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 17:02:12,059 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 17:02:12,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,059 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 17:02:12,059 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 17:02:12,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,059 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 17:02:12,060 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 17:02:12,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,060 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 17:02:12,060 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 17:02:12,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,060 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 17:02:12,060 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 17:02:12,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,061 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 17:02:12,061 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 17:02:12,061 INFO L273 TraceCheckUtils]: 40: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 17:02:12,061 INFO L273 TraceCheckUtils]: 42: Hoare triple {3810#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 17:02:12,061 INFO L273 TraceCheckUtils]: 43: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,061 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3810#true} {3810#true} #73#return; {3810#true} is VALID [2018-11-14 17:02:12,061 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 17:02:12,062 INFO L256 TraceCheckUtils]: 46: Hoare triple {3810#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 17:02:12,062 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 17:02:12,062 INFO L273 TraceCheckUtils]: 48: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,062 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 17:02:12,062 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 17:02:12,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,062 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 17:02:12,062 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 17:02:12,063 INFO L273 TraceCheckUtils]: 54: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,063 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 17:02:12,063 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 17:02:12,063 INFO L273 TraceCheckUtils]: 57: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,063 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 17:02:12,063 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 17:02:12,063 INFO L273 TraceCheckUtils]: 60: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,063 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 17:02:12,064 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 17:02:12,064 INFO L273 TraceCheckUtils]: 63: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,064 INFO L273 TraceCheckUtils]: 64: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 17:02:12,064 INFO L273 TraceCheckUtils]: 65: Hoare triple {3810#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 17:02:12,064 INFO L273 TraceCheckUtils]: 66: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,064 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3810#true} {3810#true} #75#return; {3810#true} is VALID [2018-11-14 17:02:12,065 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 17:02:12,066 INFO L273 TraceCheckUtils]: 69: Hoare triple {3812#(= main_~i~2 0)} assume true; {3812#(= main_~i~2 0)} is VALID [2018-11-14 17:02:12,067 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 17:02:12,071 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 17:02:12,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {3813#(<= main_~i~2 1)} assume true; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 17:02:12,073 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 17:02:12,074 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 17:02:12,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {3814#(<= main_~i~2 2)} assume true; {3814#(<= main_~i~2 2)} is VALID [2018-11-14 17:02:12,081 INFO L273 TraceCheckUtils]: 76: Hoare triple {3814#(<= main_~i~2 2)} assume !(~i~2 < 4); {3811#false} is VALID [2018-11-14 17:02:12,081 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 17:02:12,081 INFO L256 TraceCheckUtils]: 78: Hoare triple {3811#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 17:02:12,081 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 17:02:12,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,082 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 17:02:12,082 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 17:02:12,082 INFO L273 TraceCheckUtils]: 83: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,082 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 17:02:12,082 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 17:02:12,082 INFO L273 TraceCheckUtils]: 86: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,082 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 17:02:12,082 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 17:02:12,082 INFO L273 TraceCheckUtils]: 89: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,083 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 17:02:12,083 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 17:02:12,083 INFO L273 TraceCheckUtils]: 92: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,083 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 17:02:12,083 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 17:02:12,083 INFO L273 TraceCheckUtils]: 95: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,083 INFO L273 TraceCheckUtils]: 96: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 17:02:12,083 INFO L273 TraceCheckUtils]: 97: Hoare triple {3810#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 17:02:12,084 INFO L273 TraceCheckUtils]: 98: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,084 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {3810#true} {3811#false} #77#return; {3811#false} is VALID [2018-11-14 17:02:12,084 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 17:02:12,084 INFO L273 TraceCheckUtils]: 101: Hoare triple {3811#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3811#false} is VALID [2018-11-14 17:02:12,084 INFO L273 TraceCheckUtils]: 102: Hoare triple {3811#false} assume !false; {3811#false} is VALID [2018-11-14 17:02:12,089 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 17:02:12,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:12,089 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 17:02:12,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:12,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:12,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {3810#true} call ULTIMATE.init(); {3810#true} is VALID [2018-11-14 17:02:12,455 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 17:02:12,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3810#true} {3810#true} #69#return; {3810#true} is VALID [2018-11-14 17:02:12,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {3810#true} call #t~ret12 := main(); {3810#true} is VALID [2018-11-14 17:02:12,456 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 17:02:12,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,456 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 17:02:12,456 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 17:02:12,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,456 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 17:02:12,457 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 17:02:12,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,457 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 17:02:12,457 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 17:02:12,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,457 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 17:02:12,457 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 17:02:12,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,458 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 17:02:12,458 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 17:02:12,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {3810#true} assume !(~i~1 < 5); {3810#true} is VALID [2018-11-14 17:02:12,458 INFO L256 TraceCheckUtils]: 23: Hoare triple {3810#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 17:02:12,458 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 17:02:12,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,458 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 17:02:12,459 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 17:02:12,459 INFO L273 TraceCheckUtils]: 28: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,459 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 17:02:12,459 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 17:02:12,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,459 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 17:02:12,459 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 17:02:12,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,460 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 17:02:12,460 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 17:02:12,460 INFO L273 TraceCheckUtils]: 37: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,460 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 17:02:12,460 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 17:02:12,461 INFO L273 TraceCheckUtils]: 40: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,461 INFO L273 TraceCheckUtils]: 41: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 17:02:12,461 INFO L273 TraceCheckUtils]: 42: Hoare triple {3810#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 17:02:12,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,461 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3810#true} {3810#true} #73#return; {3810#true} is VALID [2018-11-14 17:02:12,461 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 17:02:12,462 INFO L256 TraceCheckUtils]: 46: Hoare triple {3810#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3810#true} is VALID [2018-11-14 17:02:12,462 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 17:02:12,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,462 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 17:02:12,462 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 17:02:12,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,463 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 17:02:12,463 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 17:02:12,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,463 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 17:02:12,463 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 17:02:12,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,463 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 17:02:12,464 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 17:02:12,464 INFO L273 TraceCheckUtils]: 60: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,464 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 17:02:12,464 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 17:02:12,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {3810#true} assume !(~i~0 < 5); {3810#true} is VALID [2018-11-14 17:02:12,465 INFO L273 TraceCheckUtils]: 65: Hoare triple {3810#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3810#true} is VALID [2018-11-14 17:02:12,465 INFO L273 TraceCheckUtils]: 66: Hoare triple {3810#true} assume true; {3810#true} is VALID [2018-11-14 17:02:12,465 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3810#true} {3810#true} #75#return; {3810#true} is VALID [2018-11-14 17:02:12,466 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 17:02:12,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {4022#(<= main_~i~2 0)} assume true; {4022#(<= main_~i~2 0)} is VALID [2018-11-14 17:02:12,469 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 17:02:12,469 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 17:02:12,471 INFO L273 TraceCheckUtils]: 72: Hoare triple {3813#(<= main_~i~2 1)} assume true; {3813#(<= main_~i~2 1)} is VALID [2018-11-14 17:02:12,471 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 17:02:12,473 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 17:02:12,473 INFO L273 TraceCheckUtils]: 75: Hoare triple {3814#(<= main_~i~2 2)} assume true; {3814#(<= main_~i~2 2)} is VALID [2018-11-14 17:02:12,475 INFO L273 TraceCheckUtils]: 76: Hoare triple {3814#(<= main_~i~2 2)} assume !(~i~2 < 4); {3811#false} is VALID [2018-11-14 17:02:12,475 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 17:02:12,475 INFO L256 TraceCheckUtils]: 78: Hoare triple {3811#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3811#false} is VALID [2018-11-14 17:02:12,475 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 17:02:12,475 INFO L273 TraceCheckUtils]: 80: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,475 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 17:02:12,475 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 17:02:12,476 INFO L273 TraceCheckUtils]: 83: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,476 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 17:02:12,476 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 17:02:12,476 INFO L273 TraceCheckUtils]: 86: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,476 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 17:02:12,476 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 17:02:12,476 INFO L273 TraceCheckUtils]: 89: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,476 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 17:02:12,477 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 17:02:12,477 INFO L273 TraceCheckUtils]: 92: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,477 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 17:02:12,477 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 17:02:12,477 INFO L273 TraceCheckUtils]: 95: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,477 INFO L273 TraceCheckUtils]: 96: Hoare triple {3811#false} assume !(~i~0 < 5); {3811#false} is VALID [2018-11-14 17:02:12,477 INFO L273 TraceCheckUtils]: 97: Hoare triple {3811#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {3811#false} is VALID [2018-11-14 17:02:12,477 INFO L273 TraceCheckUtils]: 98: Hoare triple {3811#false} assume true; {3811#false} is VALID [2018-11-14 17:02:12,478 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {3811#false} {3811#false} #77#return; {3811#false} is VALID [2018-11-14 17:02:12,478 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 17:02:12,478 INFO L273 TraceCheckUtils]: 101: Hoare triple {3811#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3811#false} is VALID [2018-11-14 17:02:12,478 INFO L273 TraceCheckUtils]: 102: Hoare triple {3811#false} assume !false; {3811#false} is VALID [2018-11-14 17:02:12,483 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 17:02:12,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:12,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:02:12,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-14 17:02:12,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:12,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:02:12,582 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 17:02:12,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:02:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:02:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:02:12,583 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2018-11-14 17:02:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:12,738 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-11-14 17:02:12,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:02:12,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-14 17:02:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:02:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-14 17:02:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:02:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-14 17:02:12,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-11-14 17:02:12,798 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 17:02:12,800 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:02:12,800 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:02:12,801 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 17:02:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:02:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 17:02:12,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:12,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 17:02:12,822 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 17:02:12,822 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 17:02:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:12,824 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:02:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:02:12,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:12,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:12,825 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 17:02:12,825 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 17:02:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:12,827 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:02:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:02:12,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:12,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:12,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:12,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:02:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 17:02:12,830 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 103 [2018-11-14 17:02:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 17:02:12,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:02:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 17:02:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 17:02:12,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:12,832 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 17:02:12,832 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:12,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash -89829427, now seen corresponding path program 8 times [2018-11-14 17:02:12,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:12,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:02:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:13,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {4470#true} call ULTIMATE.init(); {4470#true} is VALID [2018-11-14 17:02:13,002 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 17:02:13,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4470#true} {4470#true} #69#return; {4470#true} is VALID [2018-11-14 17:02:13,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {4470#true} call #t~ret12 := main(); {4470#true} is VALID [2018-11-14 17:02:13,003 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 17:02:13,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,004 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 17:02:13,004 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 17:02:13,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,004 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 17:02:13,005 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 17:02:13,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,005 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 17:02:13,005 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 17:02:13,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,006 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 17:02:13,006 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 17:02:13,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,006 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 17:02:13,006 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 17:02:13,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {4470#true} assume !(~i~1 < 5); {4470#true} is VALID [2018-11-14 17:02:13,007 INFO L256 TraceCheckUtils]: 23: Hoare triple {4470#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 17:02:13,007 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 17:02:13,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,007 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 17:02:13,007 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 17:02:13,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,008 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 17:02:13,008 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 17:02:13,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,008 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 17:02:13,008 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 17:02:13,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,008 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 17:02:13,008 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 17:02:13,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,009 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 17:02:13,009 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 17:02:13,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,009 INFO L273 TraceCheckUtils]: 41: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 17:02:13,009 INFO L273 TraceCheckUtils]: 42: Hoare triple {4470#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 17:02:13,009 INFO L273 TraceCheckUtils]: 43: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,009 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4470#true} {4470#true} #73#return; {4470#true} is VALID [2018-11-14 17:02:13,010 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 17:02:13,010 INFO L256 TraceCheckUtils]: 46: Hoare triple {4470#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 17:02:13,010 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 17:02:13,010 INFO L273 TraceCheckUtils]: 48: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,010 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 17:02:13,010 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 17:02:13,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,010 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 17:02:13,011 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 17:02:13,011 INFO L273 TraceCheckUtils]: 54: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,011 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 17:02:13,011 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 17:02:13,011 INFO L273 TraceCheckUtils]: 57: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,011 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 17:02:13,011 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 17:02:13,011 INFO L273 TraceCheckUtils]: 60: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,012 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 17:02:13,012 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 17:02:13,012 INFO L273 TraceCheckUtils]: 63: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,012 INFO L273 TraceCheckUtils]: 64: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 17:02:13,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {4470#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 17:02:13,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,012 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4470#true} {4470#true} #75#return; {4470#true} is VALID [2018-11-14 17:02:13,014 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 17:02:13,015 INFO L273 TraceCheckUtils]: 69: Hoare triple {4472#(= main_~i~2 0)} assume true; {4472#(= main_~i~2 0)} is VALID [2018-11-14 17:02:13,015 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 17:02:13,017 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 17:02:13,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {4473#(<= main_~i~2 1)} assume true; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 17:02:13,018 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 17:02:13,018 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 17:02:13,019 INFO L273 TraceCheckUtils]: 75: Hoare triple {4474#(<= main_~i~2 2)} assume true; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 17:02:13,019 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 17:02:13,019 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 17:02:13,020 INFO L273 TraceCheckUtils]: 78: Hoare triple {4475#(<= main_~i~2 3)} assume true; {4475#(<= main_~i~2 3)} is VALID [2018-11-14 17:02:13,020 INFO L273 TraceCheckUtils]: 79: Hoare triple {4475#(<= main_~i~2 3)} assume !(~i~2 < 4); {4471#false} is VALID [2018-11-14 17:02:13,021 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 17:02:13,021 INFO L256 TraceCheckUtils]: 81: Hoare triple {4471#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 17:02:13,021 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 17:02:13,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,022 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 17:02:13,022 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 17:02:13,022 INFO L273 TraceCheckUtils]: 86: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,022 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 17:02:13,022 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 17:02:13,023 INFO L273 TraceCheckUtils]: 89: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,023 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 17:02:13,023 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 17:02:13,023 INFO L273 TraceCheckUtils]: 92: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,024 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 17:02:13,024 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 17:02:13,024 INFO L273 TraceCheckUtils]: 95: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,024 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 17:02:13,024 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 17:02:13,025 INFO L273 TraceCheckUtils]: 98: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,025 INFO L273 TraceCheckUtils]: 99: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 17:02:13,025 INFO L273 TraceCheckUtils]: 100: Hoare triple {4470#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 17:02:13,025 INFO L273 TraceCheckUtils]: 101: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,025 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {4470#true} {4471#false} #77#return; {4471#false} is VALID [2018-11-14 17:02:13,025 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 17:02:13,025 INFO L273 TraceCheckUtils]: 104: Hoare triple {4471#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4471#false} is VALID [2018-11-14 17:02:13,026 INFO L273 TraceCheckUtils]: 105: Hoare triple {4471#false} assume !false; {4471#false} is VALID [2018-11-14 17:02:13,031 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 17:02:13,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:02:13,031 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 17:02:13,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:02:13,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:02:13,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:02:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:02:13,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:02:13,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {4470#true} call ULTIMATE.init(); {4470#true} is VALID [2018-11-14 17:02:13,298 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 17:02:13,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4470#true} {4470#true} #69#return; {4470#true} is VALID [2018-11-14 17:02:13,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {4470#true} call #t~ret12 := main(); {4470#true} is VALID [2018-11-14 17:02:13,299 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 17:02:13,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,299 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 17:02:13,300 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 17:02:13,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,300 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 17:02:13,300 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 17:02:13,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,300 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 17:02:13,300 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 17:02:13,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,300 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 17:02:13,301 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 17:02:13,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,301 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 17:02:13,301 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 17:02:13,301 INFO L273 TraceCheckUtils]: 21: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {4470#true} assume !(~i~1 < 5); {4470#true} is VALID [2018-11-14 17:02:13,301 INFO L256 TraceCheckUtils]: 23: Hoare triple {4470#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 17:02:13,301 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 17:02:13,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,302 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 17:02:13,302 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 17:02:13,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,302 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 17:02:13,302 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 17:02:13,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,302 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 17:02:13,303 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 17:02:13,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,303 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 17:02:13,303 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 17:02:13,303 INFO L273 TraceCheckUtils]: 37: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,303 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 17:02:13,303 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 17:02:13,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,304 INFO L273 TraceCheckUtils]: 41: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 17:02:13,304 INFO L273 TraceCheckUtils]: 42: Hoare triple {4470#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 17:02:13,304 INFO L273 TraceCheckUtils]: 43: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,304 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4470#true} {4470#true} #73#return; {4470#true} is VALID [2018-11-14 17:02:13,304 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 17:02:13,304 INFO L256 TraceCheckUtils]: 46: Hoare triple {4470#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {4470#true} is VALID [2018-11-14 17:02:13,304 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 17:02:13,304 INFO L273 TraceCheckUtils]: 48: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,305 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 17:02:13,305 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 17:02:13,305 INFO L273 TraceCheckUtils]: 51: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,305 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 17:02:13,305 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 17:02:13,305 INFO L273 TraceCheckUtils]: 54: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,306 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 17:02:13,306 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 17:02:13,306 INFO L273 TraceCheckUtils]: 57: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,306 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 17:02:13,306 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 17:02:13,306 INFO L273 TraceCheckUtils]: 60: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,307 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 17:02:13,307 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 17:02:13,307 INFO L273 TraceCheckUtils]: 63: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,307 INFO L273 TraceCheckUtils]: 64: Hoare triple {4470#true} assume !(~i~0 < 5); {4470#true} is VALID [2018-11-14 17:02:13,307 INFO L273 TraceCheckUtils]: 65: Hoare triple {4470#true} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {4470#true} is VALID [2018-11-14 17:02:13,308 INFO L273 TraceCheckUtils]: 66: Hoare triple {4470#true} assume true; {4470#true} is VALID [2018-11-14 17:02:13,308 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4470#true} {4470#true} #75#return; {4470#true} is VALID [2018-11-14 17:02:13,323 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 17:02:13,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {4683#(<= main_~i~2 0)} assume true; {4683#(<= main_~i~2 0)} is VALID [2018-11-14 17:02:13,325 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 17:02:13,326 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 17:02:13,328 INFO L273 TraceCheckUtils]: 72: Hoare triple {4473#(<= main_~i~2 1)} assume true; {4473#(<= main_~i~2 1)} is VALID [2018-11-14 17:02:13,328 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 17:02:13,330 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 17:02:13,330 INFO L273 TraceCheckUtils]: 75: Hoare triple {4474#(<= main_~i~2 2)} assume true; {4474#(<= main_~i~2 2)} is VALID [2018-11-14 17:02:13,330 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 17:02:13,331 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 17:02:13,331 INFO L273 TraceCheckUtils]: 78: Hoare triple {4475#(<= main_~i~2 3)} assume true; {4475#(<= main_~i~2 3)} is VALID [2018-11-14 17:02:13,332 INFO L273 TraceCheckUtils]: 79: Hoare triple {4475#(<= main_~i~2 3)} assume !(~i~2 < 4); {4471#false} is VALID [2018-11-14 17:02:13,332 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 17:02:13,332 INFO L256 TraceCheckUtils]: 81: Hoare triple {4471#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {4471#false} is VALID [2018-11-14 17:02:13,332 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 17:02:13,332 INFO L273 TraceCheckUtils]: 83: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,332 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 17:02:13,333 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 17:02:13,333 INFO L273 TraceCheckUtils]: 86: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,333 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 17:02:13,333 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 17:02:13,334 INFO L273 TraceCheckUtils]: 89: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,334 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 17:02:13,334 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 17:02:13,334 INFO L273 TraceCheckUtils]: 92: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,334 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 17:02:13,335 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 17:02:13,335 INFO L273 TraceCheckUtils]: 95: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,335 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 17:02:13,335 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 17:02:13,335 INFO L273 TraceCheckUtils]: 98: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,336 INFO L273 TraceCheckUtils]: 99: Hoare triple {4471#false} assume !(~i~0 < 5); {4471#false} is VALID [2018-11-14 17:02:13,336 INFO L273 TraceCheckUtils]: 100: Hoare triple {4471#false} #res := (if (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 else (if ~ret~0 < 0 && ~ret~0 % 5 != 0 then ~ret~0 / 5 + 1 else ~ret~0 / 5) % 4294967296 - 4294967296); {4471#false} is VALID [2018-11-14 17:02:13,336 INFO L273 TraceCheckUtils]: 101: Hoare triple {4471#false} assume true; {4471#false} is VALID [2018-11-14 17:02:13,336 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {4471#false} {4471#false} #77#return; {4471#false} is VALID [2018-11-14 17:02:13,336 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 17:02:13,336 INFO L273 TraceCheckUtils]: 104: Hoare triple {4471#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4471#false} is VALID [2018-11-14 17:02:13,337 INFO L273 TraceCheckUtils]: 105: Hoare triple {4471#false} assume !false; {4471#false} is VALID [2018-11-14 17:02:13,344 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 17:02:13,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:02:13,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:02:13,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-14 17:02:13,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:02:13,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:02:13,421 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 17:02:13,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:02:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:02:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:02:13,422 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-11-14 17:02:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:13,745 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-14 17:02:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:02:13,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-14 17:02:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:02:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:02:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:02:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:02:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:02:13,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 17:02:13,882 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 17:02:13,884 INFO L225 Difference]: With dead ends: 95 [2018-11-14 17:02:13,884 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 17:02:13,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:02:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 17:02:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-14 17:02:13,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:02:13,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-14 17:02:13,909 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 17:02:13,909 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 17:02:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:13,911 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 17:02:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:02:13,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:13,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:13,912 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 17:02:13,912 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 17:02:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:02:13,915 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 17:02:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:02:13,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:02:13,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:02:13,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:02:13,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:02:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:02:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 17:02:13,918 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 106 [2018-11-14 17:02:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:02:13,919 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 17:02:13,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:02:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:02:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:02:13,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:02:13,920 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 17:02:13,921 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:02:13,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:02:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1127785249, now seen corresponding path program 9 times [2018-11-14 17:02:13,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:02:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:02:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:13,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:02:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:02:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat