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/array-tiling/pnr5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:11:15,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:11:15,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:11:15,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:11:15,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:11:15,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:11:15,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:11:15,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:11:15,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:11:15,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:11:15,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:11:15,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:11:15,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:11:15,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:11:15,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:11:15,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:11:15,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:11:15,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:11:15,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:11:15,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:11:15,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:11:15,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:11:15,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:11:15,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:11:15,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:11:15,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:11:15,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:11:15,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:11:15,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:11:15,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:11:15,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:11:15,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:11:15,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:11:15,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:11:15,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:11:15,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:11:15,240 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-18 23:11:15,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:11:15,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:11:15,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:11:15,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:11:15,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:11:15,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:11:15,269 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:11:15,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:11:15,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:11:15,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:11:15,270 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:11:15,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:11:15,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:11:15,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:11:15,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:11:15,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:11:15,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:11:15,272 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:11:15,272 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:11:15,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:11:15,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:11:15,274 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:11:15,274 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:11:15,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:11:15,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:11:15,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:11:15,275 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:11:15,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:11:15,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:11:15,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:11:15,276 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:11:15,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:11:15,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:11:15,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:11:15,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:11:15,364 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:11:15,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr5_true-unreach-call.i [2018-11-18 23:11:15,421 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f39d88c/bb743cf0e8264f7abbd287e441843465/FLAGd86356ba8 [2018-11-18 23:11:15,836 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:11:15,837 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr5_true-unreach-call.i [2018-11-18 23:11:15,845 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f39d88c/bb743cf0e8264f7abbd287e441843465/FLAGd86356ba8 [2018-11-18 23:11:16,199 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f39d88c/bb743cf0e8264f7abbd287e441843465 [2018-11-18 23:11:16,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:11:16,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:11:16,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:11:16,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:11:16,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:11:16,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e970c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16, skipping insertion in model container [2018-11-18 23:11:16,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:11:16,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:11:16,561 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:11:16,569 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:11:16,615 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:11:16,639 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:11:16,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16 WrapperNode [2018-11-18 23:11:16,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:11:16,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:11:16,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:11:16,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:11:16,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (1/1) ... [2018-11-18 23:11:16,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:11:16,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:11:16,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:11:16,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:11:16,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (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-18 23:11:16,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:11:16,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:11:16,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:11:16,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:11:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-18 23:11:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:11:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:11:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:11:16,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:11:16,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:11:16,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:11:17,836 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:11:17,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:17 BoogieIcfgContainer [2018-11-18 23:11:17,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:11:17,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:11:17,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:11:17,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:11:17,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:11:16" (1/3) ... [2018-11-18 23:11:17,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b894e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:11:17, skipping insertion in model container [2018-11-18 23:11:17,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:16" (2/3) ... [2018-11-18 23:11:17,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b894e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:11:17, skipping insertion in model container [2018-11-18 23:11:17,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:17" (3/3) ... [2018-11-18 23:11:17,846 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr5_true-unreach-call.i [2018-11-18 23:11:17,856 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:11:17,864 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:11:17,879 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:11:17,911 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:11:17,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:11:17,912 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:11:17,912 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:11:17,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:11:17,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:11:17,913 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:11:17,913 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:11:17,913 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:11:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 23:11:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:11:17,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:17,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:17,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:17,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2139069025, now seen corresponding path program 1 times [2018-11-18 23:11:17,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:17,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:18,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:18,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:18,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-18 23:11:18,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {41#true} is VALID [2018-11-18 23:11:18,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-18 23:11:18,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #97#return; {41#true} is VALID [2018-11-18 23:11:18,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret10 := main(); {41#true} is VALID [2018-11-18 23:11:18,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {41#true} is VALID [2018-11-18 23:11:18,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {41#true} is VALID [2018-11-18 23:11:18,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {41#true} is VALID [2018-11-18 23:11:18,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-18 23:11:18,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2018-11-18 23:11:18,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-18 23:11:18,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42#false} is VALID [2018-11-18 23:11:18,137 INFO L256 TraceCheckUtils]: 12: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {42#false} is VALID [2018-11-18 23:11:18,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-18 23:11:18,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2018-11-18 23:11:18,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-18 23:11:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:18,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:11:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:11:18,151 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 23:11:18,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:18,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:11:18,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:18,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:11:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:11:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:11:18,243 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-18 23:11:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:18,372 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-18 23:11:18,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:11:18,372 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 23:11:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:11:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-18 23:11:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:11:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-18 23:11:18,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-18 23:11:18,653 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-18 23:11:18,664 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:11:18,664 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 23:11:18,668 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-18 23:11:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 23:11:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-18 23:11:18,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:18,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-18 23:11:18,810 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-18 23:11:18,810 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-18 23:11:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:18,815 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-18 23:11:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-18 23:11:18,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:18,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:18,817 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-18 23:11:18,817 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-18 23:11:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:18,822 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-18 23:11:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-18 23:11:18,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:18,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:18,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:18,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 23:11:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-18 23:11:18,829 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2018-11-18 23:11:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:18,829 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-18 23:11:18,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:11:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-18 23:11:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:11:18,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:18,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:18,831 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:18,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1671014515, now seen corresponding path program 1 times [2018-11-18 23:11:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:19,218 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-11-18 23:11:19,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-18 23:11:19,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {216#true} is VALID [2018-11-18 23:11:19,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-18 23:11:19,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #97#return; {216#true} is VALID [2018-11-18 23:11:19,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret10 := main(); {216#true} is VALID [2018-11-18 23:11:19,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {216#true} is VALID [2018-11-18 23:11:19,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {216#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {218#(<= 2 ~SIZE~0)} is VALID [2018-11-18 23:11:19,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {219#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:19,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {219#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume true; {219#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:19,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {219#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {217#false} is VALID [2018-11-18 23:11:19,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-18 23:11:19,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-18 23:11:19,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {217#false} is VALID [2018-11-18 23:11:19,345 INFO L256 TraceCheckUtils]: 13: Hoare triple {217#false} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {217#false} is VALID [2018-11-18 23:11:19,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#false} ~cond := #in~cond; {217#false} is VALID [2018-11-18 23:11:19,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} assume 0 == ~cond; {217#false} is VALID [2018-11-18 23:11:19,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-18 23:11:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:19,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:11:19,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:11:19,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-18 23:11:19,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:19,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:11:19,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:19,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:11:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:11:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:11:19,572 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2018-11-18 23:11:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:19,960 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-18 23:11:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:11:19,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-18 23:11:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:11:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-18 23:11:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:11:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-18 23:11:19,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-18 23:11:20,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:20,132 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:11:20,132 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:11:20,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:11:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:11:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-18 23:11:20,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:20,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2018-11-18 23:11:20,174 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2018-11-18 23:11:20,175 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2018-11-18 23:11:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:20,179 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-11-18 23:11:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-18 23:11:20,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:20,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:20,180 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2018-11-18 23:11:20,181 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2018-11-18 23:11:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:20,184 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-11-18 23:11:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-18 23:11:20,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:20,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:20,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:20,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 23:11:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-18 23:11:20,189 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2018-11-18 23:11:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:20,189 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-18 23:11:20,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:11:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-18 23:11:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:11:20,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:20,191 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:20,191 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:20,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash -922059818, now seen corresponding path program 1 times [2018-11-18 23:11:20,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:20,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:21,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {421#true} is VALID [2018-11-18 23:11:21,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {421#true} is VALID [2018-11-18 23:11:21,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {421#true} assume true; {421#true} is VALID [2018-11-18 23:11:21,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} #97#return; {421#true} is VALID [2018-11-18 23:11:21,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {421#true} call #t~ret10 := main(); {421#true} is VALID [2018-11-18 23:11:21,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {421#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {421#true} is VALID [2018-11-18 23:11:21,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {421#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {423#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {424#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {424#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume true; {424#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {424#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {424#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {425#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {426#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {426#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume true; {426#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {426#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:21,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {429#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:11:21,458 INFO L256 TraceCheckUtils]: 25: Hoare triple {429#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {430#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:11:21,462 INFO L273 TraceCheckUtils]: 26: Hoare triple {430#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {431#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:11:21,462 INFO L273 TraceCheckUtils]: 27: Hoare triple {431#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {422#false} is VALID [2018-11-18 23:11:21,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {422#false} assume !false; {422#false} is VALID [2018-11-18 23:11:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:21,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:11:21,471 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-18 23:11:21,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:21,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:11:21,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:11:21,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:11:21,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:21,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:21,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:21,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-18 23:11:21,946 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:22,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:11:22,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:22,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:11:22,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:11:22,071 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:22,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:11:22,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:22,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:11:22,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:11:22,164 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:22,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:11:22,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:22,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:11:22,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:11:22,264 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:22,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-18 23:11:22,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:22,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-11-18 23:11:22,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2018-11-18 23:11:22,349 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:22,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 23:11:22,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 23:11:22,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:22,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 23:11:22,426 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:22,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {421#true} is VALID [2018-11-18 23:11:22,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {421#true} is VALID [2018-11-18 23:11:22,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {421#true} assume true; {421#true} is VALID [2018-11-18 23:11:22,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} #97#return; {421#true} is VALID [2018-11-18 23:11:22,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {421#true} call #t~ret10 := main(); {421#true} is VALID [2018-11-18 23:11:22,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {421#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {421#true} is VALID [2018-11-18 23:11:22,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {421#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {453#(= |main_~#a~0.offset| 0)} is VALID [2018-11-18 23:11:22,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {453#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {457#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {457#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {457#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {457#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {457#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {467#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} assume true; {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:22,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {428#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {429#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:11:22,791 INFO L256 TraceCheckUtils]: 25: Hoare triple {429#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {513#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:11:22,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {513#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {517#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:11:22,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {517#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {422#false} is VALID [2018-11-18 23:11:22,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {422#false} assume !false; {422#false} is VALID [2018-11-18 23:11:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:22,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:11:22,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-11-18 23:11:22,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-18 23:11:22,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:22,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 23:11:22,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:22,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 23:11:22,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 23:11:22,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-18 23:11:22,933 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 16 states. [2018-11-18 23:11:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:25,358 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2018-11-18 23:11:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:11:25,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-18 23:11:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:11:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2018-11-18 23:11:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:11:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2018-11-18 23:11:25,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 123 transitions. [2018-11-18 23:11:25,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:25,709 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:11:25,709 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 23:11:25,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-18 23:11:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 23:11:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2018-11-18 23:11:25,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:25,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 54 states. [2018-11-18 23:11:25,789 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 54 states. [2018-11-18 23:11:25,790 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 54 states. [2018-11-18 23:11:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:25,799 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2018-11-18 23:11:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2018-11-18 23:11:25,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:25,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:25,801 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 94 states. [2018-11-18 23:11:25,801 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 94 states. [2018-11-18 23:11:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:25,807 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2018-11-18 23:11:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2018-11-18 23:11:25,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:25,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:25,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:25,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:11:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-18 23:11:25,813 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 29 [2018-11-18 23:11:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:25,813 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-18 23:11:25,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 23:11:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-18 23:11:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:11:25,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:25,814 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:25,815 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1683963736, now seen corresponding path program 1 times [2018-11-18 23:11:25,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:25,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:25,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:25,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:26,191 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-18 23:11:27,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-18 23:11:27,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {905#true} is VALID [2018-11-18 23:11:27,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-18 23:11:27,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #97#return; {905#true} is VALID [2018-11-18 23:11:27,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret10 := main(); {905#true} is VALID [2018-11-18 23:11:27,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {905#true} is VALID [2018-11-18 23:11:27,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {905#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {907#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {907#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {908#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {908#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume true; {908#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {908#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {908#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {908#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,041 INFO L273 TraceCheckUtils]: 16: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {909#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (not (= main_~FIXEDVAL~0 0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {910#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {910#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= 20 (+ (* 20 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {911#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {911#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume true; {911#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {911#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (and (<= 2 ~SIZE~0) (<= (+ (* 20 main_~i~0) |main_~#a~0.offset|) 39))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {912#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {912#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {913#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {913#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {913#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:27,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {914#(not (= |main_#t~mem9| main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:11:27,049 INFO L256 TraceCheckUtils]: 25: Hoare triple {914#(not (= |main_#t~mem9| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {915#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:11:27,050 INFO L273 TraceCheckUtils]: 26: Hoare triple {915#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {916#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:11:27,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {916#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {906#false} is VALID [2018-11-18 23:11:27,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-18 23:11:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:27,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:11:27,061 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-18 23:11:27,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:27,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:11:27,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:11:27,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:11:27,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 23:11:27,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 23:11:27,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:27,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 23:11:27,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-18 23:11:27,327 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:27,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 23:11:27,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:27,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 23:11:27,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-18 23:11:27,390 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:27,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 23:11:27,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:27,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 23:11:27,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-18 23:11:27,448 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:27,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-18 23:11:27,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:27,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:11:27,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-18 23:11:27,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-18 23:11:27,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 23:11:27,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:27,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2018-11-18 23:11:27,725 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:27,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-18 23:11:27,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {905#true} is VALID [2018-11-18 23:11:27,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-18 23:11:27,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #97#return; {905#true} is VALID [2018-11-18 23:11:27,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret10 := main(); {905#true} is VALID [2018-11-18 23:11:27,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {905#true} is VALID [2018-11-18 23:11:27,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {905#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {938#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {938#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {942#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {942#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {942#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {942#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {942#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {942#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {952#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 20)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {977#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {990#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {990#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {990#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {990#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {997#(and (<= 10 |main_#t~mem9|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:27,836 INFO L256 TraceCheckUtils]: 25: Hoare triple {997#(and (<= 10 |main_#t~mem9|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {1001#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:11:27,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {1001#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1005#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:11:27,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {1005#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {906#false} is VALID [2018-11-18 23:11:27,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-18 23:11:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:27,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:11:27,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-18 23:11:27,864 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-11-18 23:11:27,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:27,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 23:11:27,952 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-18 23:11:27,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 23:11:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 23:11:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:11:27,954 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 20 states. [2018-11-18 23:11:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:32,040 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-18 23:11:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 23:11:32,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-11-18 23:11:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:11:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-18 23:11:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:11:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-18 23:11:32,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2018-11-18 23:11:32,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:32,485 INFO L225 Difference]: With dead ends: 109 [2018-11-18 23:11:32,485 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 23:11:32,486 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 23:11:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 23:11:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 41. [2018-11-18 23:11:32,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:32,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 41 states. [2018-11-18 23:11:32,583 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 41 states. [2018-11-18 23:11:32,583 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 41 states. [2018-11-18 23:11:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:32,591 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2018-11-18 23:11:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2018-11-18 23:11:32,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:32,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:32,593 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 107 states. [2018-11-18 23:11:32,593 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 107 states. [2018-11-18 23:11:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:32,606 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2018-11-18 23:11:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2018-11-18 23:11:32,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:32,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:32,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:32,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 23:11:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-18 23:11:32,614 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-11-18 23:11:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:32,614 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 23:11:32,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 23:11:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 23:11:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 23:11:32,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:32,618 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:32,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:32,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash 836072071, now seen corresponding path program 1 times [2018-11-18 23:11:32,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:32,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:32,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:33,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2018-11-18 23:11:33,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {1438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1438#true} is VALID [2018-11-18 23:11:33,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2018-11-18 23:11:33,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #97#return; {1438#true} is VALID [2018-11-18 23:11:33,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret10 := main(); {1438#true} is VALID [2018-11-18 23:11:33,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {1438#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1438#true} is VALID [2018-11-18 23:11:33,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {1438#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {1440#(<= 2 ~SIZE~0)} is VALID [2018-11-18 23:11:33,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {1440#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:33,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume true; {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:33,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:33,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:33,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:33,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {1441#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:33,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {1442#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1443#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16))))))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:11:33,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {1443#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16))))))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} assume true; {1443#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16))))))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:11:33,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {1443#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16))))))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {1444#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:33,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {1444#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} ~i~0 := 0; {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:33,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume true; {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:33,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:33,312 INFO L256 TraceCheckUtils]: 25: Hoare triple {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {1438#true} is VALID [2018-11-18 23:11:33,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2018-11-18 23:11:33,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2018-11-18 23:11:33,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {1438#true} assume true; {1438#true} is VALID [2018-11-18 23:11:33,314 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1438#true} {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #95#return; {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:33,315 INFO L273 TraceCheckUtils]: 30: Hoare triple {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} havoc #t~mem9; {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:33,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {1445#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))))) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1446#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:11:33,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume true; {1446#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:11:33,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1447#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:11:33,318 INFO L256 TraceCheckUtils]: 34: Hoare triple {1447#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {1448#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:11:33,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {1448#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1449#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:11:33,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {1449#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1439#false} is VALID [2018-11-18 23:11:33,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2018-11-18 23:11:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:33,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:11:33,326 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-18 23:11:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:33,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:11:33,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:11:33,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:11:33,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-18 23:11:33,671 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:33,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:11:33,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:33,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:11:33,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:11:33,757 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:33,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:11:33,775 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:33,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:11:33,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:11:33,802 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:33,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-18 23:11:33,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:33,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-18 23:11:33,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-18 23:11:33,842 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:33,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 23:11:33,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 23:11:33,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:33,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 23:11:33,944 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:33,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2018-11-18 23:11:33,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {1438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1438#true} is VALID [2018-11-18 23:11:33,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2018-11-18 23:11:33,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #97#return; {1438#true} is VALID [2018-11-18 23:11:33,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret10 := main(); {1438#true} is VALID [2018-11-18 23:11:33,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {1438#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1438#true} is VALID [2018-11-18 23:11:33,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {1438#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {1471#(= |main_~#a~0.offset| 0)} is VALID [2018-11-18 23:11:33,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {1471#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {1475#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:33,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume true; {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,006 INFO L273 TraceCheckUtils]: 21: Hoare triple {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {1510#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,027 INFO L256 TraceCheckUtils]: 25: Hoare triple {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {1438#true} is VALID [2018-11-18 23:11:34,027 INFO L273 TraceCheckUtils]: 26: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2018-11-18 23:11:34,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2018-11-18 23:11:34,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {1438#true} assume true; {1438#true} is VALID [2018-11-18 23:11:34,037 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1438#true} {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #95#return; {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem9; {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {1523#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume true; {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:11:34,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {1491#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1447#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:11:34,052 INFO L256 TraceCheckUtils]: 34: Hoare triple {1447#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {1560#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:11:34,053 INFO L273 TraceCheckUtils]: 35: Hoare triple {1560#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1564#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:11:34,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {1564#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1439#false} is VALID [2018-11-18 23:11:34,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2018-11-18 23:11:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:34,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:11:34,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-11-18 23:11:34,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-11-18 23:11:34,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:34,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 23:11:34,193 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-18 23:11:34,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 23:11:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 23:11:34,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:11:34,195 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 19 states. [2018-11-18 23:11:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:37,731 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-11-18 23:11:37,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 23:11:37,731 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-11-18 23:11:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:11:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 160 transitions. [2018-11-18 23:11:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:11:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 160 transitions. [2018-11-18 23:11:37,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 160 transitions. [2018-11-18 23:11:38,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:38,026 INFO L225 Difference]: With dead ends: 132 [2018-11-18 23:11:38,026 INFO L226 Difference]: Without dead ends: 130 [2018-11-18 23:11:38,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 23:11:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-18 23:11:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 66. [2018-11-18 23:11:38,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:38,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 66 states. [2018-11-18 23:11:38,165 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 66 states. [2018-11-18 23:11:38,165 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 66 states. [2018-11-18 23:11:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:38,172 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-18 23:11:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2018-11-18 23:11:38,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:38,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:38,173 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 130 states. [2018-11-18 23:11:38,173 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 130 states. [2018-11-18 23:11:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:38,179 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-18 23:11:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2018-11-18 23:11:38,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:38,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:38,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:38,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 23:11:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-18 23:11:38,183 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 38 [2018-11-18 23:11:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:38,183 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-18 23:11:38,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 23:11:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-18 23:11:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 23:11:38,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:38,185 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:38,185 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:38,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 898111685, now seen corresponding path program 1 times [2018-11-18 23:11:38,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:38,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:38,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {2109#true} call ULTIMATE.init(); {2109#true} is VALID [2018-11-18 23:11:38,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {2109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2109#true} is VALID [2018-11-18 23:11:38,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {2109#true} assume true; {2109#true} is VALID [2018-11-18 23:11:38,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2109#true} {2109#true} #97#return; {2109#true} is VALID [2018-11-18 23:11:38,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {2109#true} call #t~ret10 := main(); {2109#true} is VALID [2018-11-18 23:11:38,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {2109#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2109#true} is VALID [2018-11-18 23:11:38,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {2109#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {2111#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {2111#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume true; {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {2112#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:38,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {2113#(and (not (= main_~FIXEDVAL~0 0)) (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {2114#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} is VALID [2018-11-18 23:11:38,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {2114#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2115#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16)))) main_~DEFAULTVAL~0))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:11:38,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {2115#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16)))) main_~DEFAULTVAL~0))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} assume true; {2115#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16)))) main_~DEFAULTVAL~0))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:11:38,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {2115#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ (* 5 main_~i~0) (- 5))) (- 16)))) main_~DEFAULTVAL~0))) (<= 2 ~SIZE~0) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= (* 5 main_~i~0) 10))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {2116#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:38,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {2116#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} ~i~0 := 0; {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:38,934 INFO L273 TraceCheckUtils]: 23: Hoare triple {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume true; {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:38,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:38,936 INFO L256 TraceCheckUtils]: 25: Hoare triple {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {2109#true} is VALID [2018-11-18 23:11:38,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {2109#true} ~cond := #in~cond; {2109#true} is VALID [2018-11-18 23:11:38,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {2109#true} assume !(0 == ~cond); {2109#true} is VALID [2018-11-18 23:11:38,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {2109#true} assume true; {2109#true} is VALID [2018-11-18 23:11:38,940 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2109#true} {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #95#return; {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:38,944 INFO L273 TraceCheckUtils]: 30: Hoare triple {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} havoc #t~mem9; {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:38,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {2117#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (* 5 (div ~SIZE~0 5))) (- 16)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2118#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:11:38,947 INFO L273 TraceCheckUtils]: 32: Hoare triple {2118#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} assume true; {2118#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:11:38,948 INFO L273 TraceCheckUtils]: 33: Hoare triple {2118#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2119#(not (= |main_#t~mem9| main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:11:38,949 INFO L256 TraceCheckUtils]: 34: Hoare triple {2119#(not (= |main_#t~mem9| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {2120#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:11:38,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {2120#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2121#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:11:38,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2110#false} is VALID [2018-11-18 23:11:38,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2018-11-18 23:11:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:38,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:11:38,959 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-18 23:11:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:39,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:11:39,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:11:39,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:11:39,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 23:11:39,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 23:11:39,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:39,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 23:11:39,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-18 23:11:39,360 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:39,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 23:11:39,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:39,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 23:11:39,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-18 23:11:39,468 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:39,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-18 23:11:39,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:39,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-18 23:11:39,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 23:11:39,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-18 23:11:39,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 23:11:39,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:39,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2018-11-18 23:11:39,985 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:40,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {2109#true} call ULTIMATE.init(); {2109#true} is VALID [2018-11-18 23:11:40,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {2109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2109#true} is VALID [2018-11-18 23:11:40,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {2109#true} assume true; {2109#true} is VALID [2018-11-18 23:11:40,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2109#true} {2109#true} #97#return; {2109#true} is VALID [2018-11-18 23:11:40,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {2109#true} call #t~ret10 := main(); {2109#true} is VALID [2018-11-18 23:11:40,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {2109#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2109#true} is VALID [2018-11-18 23:11:40,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {2109#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {2143#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {2143#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {2147#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} is VALID [2018-11-18 23:11:40,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} is VALID [2018-11-18 23:11:40,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} is VALID [2018-11-18 23:11:40,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} is VALID [2018-11-18 23:11:40,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} is VALID [2018-11-18 23:11:40,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} is VALID [2018-11-18 23:11:40,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {2163#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,067 INFO L273 TraceCheckUtils]: 20: Hoare triple {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {2182#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,071 INFO L256 TraceCheckUtils]: 25: Hoare triple {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-18 23:11:40,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} ~cond := #in~cond; {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-18 23:11:40,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} assume !(0 == ~cond); {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-18 23:11:40,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} assume true; {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-18 23:11:40,074 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2205#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #95#return; {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem9; {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {2195#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2224#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {2224#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {2224#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {2224#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2231#(and (<= 10 |main_#t~mem9|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:11:40,079 INFO L256 TraceCheckUtils]: 34: Hoare triple {2231#(and (<= 10 |main_#t~mem9|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {2235#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:11:40,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {2235#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2239#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:11:40,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {2239#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2110#false} is VALID [2018-11-18 23:11:40,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2018-11-18 23:11:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:40,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:11:40,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-18 23:11:40,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-11-18 23:11:40,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:40,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 23:11:40,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:40,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 23:11:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 23:11:40,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-11-18 23:11:40,223 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 23 states. [2018-11-18 23:11:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:58,619 INFO L93 Difference]: Finished difference Result 188 states and 230 transitions. [2018-11-18 23:11:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 23:11:58,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-11-18 23:11:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:11:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 156 transitions. [2018-11-18 23:11:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:11:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 156 transitions. [2018-11-18 23:11:58,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 156 transitions. [2018-11-18 23:11:58,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:58,949 INFO L225 Difference]: With dead ends: 188 [2018-11-18 23:11:58,949 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 23:11:58,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 23:11:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 23:11:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 89. [2018-11-18 23:11:59,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:59,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 89 states. [2018-11-18 23:11:59,164 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 89 states. [2018-11-18 23:11:59,164 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 89 states. [2018-11-18 23:11:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:59,171 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2018-11-18 23:11:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2018-11-18 23:11:59,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:59,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:59,172 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 186 states. [2018-11-18 23:11:59,172 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 186 states. [2018-11-18 23:11:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:59,180 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2018-11-18 23:11:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2018-11-18 23:11:59,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:59,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:59,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:59,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 23:11:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2018-11-18 23:11:59,186 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 38 [2018-11-18 23:11:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:59,186 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2018-11-18 23:11:59,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 23:11:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2018-11-18 23:11:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 23:11:59,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:59,188 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:59,188 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:59,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2050592010, now seen corresponding path program 2 times [2018-11-18 23:11:59,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:59,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:59,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:59,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:59,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {3005#true} call ULTIMATE.init(); {3005#true} is VALID [2018-11-18 23:11:59,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {3005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3005#true} is VALID [2018-11-18 23:11:59,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {3005#true} assume true; {3005#true} is VALID [2018-11-18 23:11:59,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3005#true} {3005#true} #97#return; {3005#true} is VALID [2018-11-18 23:11:59,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {3005#true} call #t~ret10 := main(); {3005#true} is VALID [2018-11-18 23:11:59,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {3005#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3005#true} is VALID [2018-11-18 23:11:59,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {3005#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {3007#(<= 2 ~SIZE~0)} is VALID [2018-11-18 23:11:59,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {3007#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume true; {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {3008#(and (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:11:59,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {3009#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3010#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12))))))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:11:59,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {3010#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12))))))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} assume true; {3010#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12))))))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:11:59,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {3010#(and (or (<= (* 5 main_~i~0) 9) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12))))))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {3011#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:59,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {3011#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)))} ~i~0 := 0; {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:59,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume true; {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:59,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:59,838 INFO L256 TraceCheckUtils]: 25: Hoare triple {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {3005#true} is VALID [2018-11-18 23:11:59,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {3005#true} ~cond := #in~cond; {3005#true} is VALID [2018-11-18 23:11:59,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {3005#true} assume !(0 == ~cond); {3005#true} is VALID [2018-11-18 23:11:59,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {3005#true} assume true; {3005#true} is VALID [2018-11-18 23:11:59,840 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3005#true} {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #95#return; {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:59,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} havoc #t~mem9; {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:11:59,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {3012#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))))) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:59,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} assume true; {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:59,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:59,844 INFO L256 TraceCheckUtils]: 34: Hoare triple {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {3005#true} is VALID [2018-11-18 23:11:59,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {3005#true} ~cond := #in~cond; {3005#true} is VALID [2018-11-18 23:11:59,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {3005#true} assume !(0 == ~cond); {3005#true} is VALID [2018-11-18 23:11:59,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {3005#true} assume true; {3005#true} is VALID [2018-11-18 23:11:59,846 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3005#true} {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} #95#return; {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:59,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} havoc #t~mem9; {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:11:59,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {3013#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))))) (< 0 (div ~SIZE~0 5)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3014#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:11:59,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {3014#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume true; {3014#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:11:59,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {3014#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3015#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:11:59,849 INFO L256 TraceCheckUtils]: 43: Hoare triple {3015#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {3016#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:11:59,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {3016#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3017#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:11:59,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {3017#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3006#false} is VALID [2018-11-18 23:11:59,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {3006#false} assume !false; {3006#false} is VALID [2018-11-18 23:11:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:11:59,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:11:59,860 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-18 23:11:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:11:59,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:11:59,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:11:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:59,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:12:00,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:12:00,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:12:00,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-18 23:12:00,028 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:00,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:12:00,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:00,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:12:00,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2018-11-18 23:12:00,101 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:00,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-18 23:12:00,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:00,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-18 23:12:00,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-18 23:12:00,159 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:00,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 23:12:00,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 23:12:00,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:00,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-18 23:12:00,451 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:00,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {3005#true} call ULTIMATE.init(); {3005#true} is VALID [2018-11-18 23:12:00,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {3005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3005#true} is VALID [2018-11-18 23:12:00,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {3005#true} assume true; {3005#true} is VALID [2018-11-18 23:12:00,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3005#true} {3005#true} #97#return; {3005#true} is VALID [2018-11-18 23:12:00,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {3005#true} call #t~ret10 := main(); {3005#true} is VALID [2018-11-18 23:12:00,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {3005#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3005#true} is VALID [2018-11-18 23:12:00,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {3005#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {3039#(and (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {3039#(and (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume true; {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {3043#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume true; {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {3078#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume true; {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,526 INFO L256 TraceCheckUtils]: 25: Hoare triple {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} ~cond := #in~cond; {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} assume !(0 == ~cond); {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} assume true; {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,529 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} #95#return; {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem9; {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {3091#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume true; {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,538 INFO L256 TraceCheckUtils]: 34: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} ~cond := #in~cond; {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} assume !(0 == ~cond); {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} assume true; {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} is VALID [2018-11-18 23:12:00,554 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3101#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) 0)))} {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} #95#return; {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem9; {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {3065#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3147#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {3147#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume true; {3147#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:12:00,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {3147#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~DEFAULTVAL~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3154#(and (= main_~DEFAULTVAL~0 0) (not (= main_~DEFAULTVAL~0 |main_#t~mem9|)))} is VALID [2018-11-18 23:12:00,557 INFO L256 TraceCheckUtils]: 43: Hoare triple {3154#(and (= main_~DEFAULTVAL~0 0) (not (= main_~DEFAULTVAL~0 |main_#t~mem9|)))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {3158#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:12:00,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {3158#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3162#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:12:00,559 INFO L273 TraceCheckUtils]: 45: Hoare triple {3162#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3006#false} is VALID [2018-11-18 23:12:00,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {3006#false} assume !false; {3006#false} is VALID [2018-11-18 23:12:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:12:00,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:12:00,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-18 23:12:00,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2018-11-18 23:12:00,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:00,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 23:12:00,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:00,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 23:12:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 23:12:00,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-11-18 23:12:00,691 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand 23 states. [2018-11-18 23:13:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:06,151 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2018-11-18 23:13:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 23:13:06,152 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2018-11-18 23:13:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:13:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2018-11-18 23:13:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:13:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2018-11-18 23:13:06,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 175 transitions. [2018-11-18 23:13:06,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:06,446 INFO L225 Difference]: With dead ends: 236 [2018-11-18 23:13:06,446 INFO L226 Difference]: Without dead ends: 234 [2018-11-18 23:13:06,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=309, Invalid=1583, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 23:13:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-18 23:13:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2018-11-18 23:13:07,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:07,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 194 states. [2018-11-18 23:13:07,653 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 194 states. [2018-11-18 23:13:07,653 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 194 states. [2018-11-18 23:13:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:07,665 INFO L93 Difference]: Finished difference Result 234 states and 292 transitions. [2018-11-18 23:13:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2018-11-18 23:13:07,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:07,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:07,666 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 234 states. [2018-11-18 23:13:07,667 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 234 states. [2018-11-18 23:13:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:07,676 INFO L93 Difference]: Finished difference Result 234 states and 292 transitions. [2018-11-18 23:13:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2018-11-18 23:13:07,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:07,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:07,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:07,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-18 23:13:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 243 transitions. [2018-11-18 23:13:07,685 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 243 transitions. Word has length 47 [2018-11-18 23:13:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:07,685 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 243 transitions. [2018-11-18 23:13:07,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 23:13:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 243 transitions. [2018-11-18 23:13:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 23:13:07,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:07,687 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:13:07,687 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:07,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:07,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2122978568, now seen corresponding path program 1 times [2018-11-18 23:13:07,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:07,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:07,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:07,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:13:07,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:08,434 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-11-18 23:13:09,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {4211#true} call ULTIMATE.init(); {4211#true} is VALID [2018-11-18 23:13:09,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {4211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4211#true} is VALID [2018-11-18 23:13:09,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {4211#true} assume true; {4211#true} is VALID [2018-11-18 23:13:09,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4211#true} {4211#true} #97#return; {4211#true} is VALID [2018-11-18 23:13:09,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {4211#true} call #t~ret10 := main(); {4211#true} is VALID [2018-11-18 23:13:09,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {4211#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4211#true} is VALID [2018-11-18 23:13:09,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {4211#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {4213#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {4213#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume true; {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {4214#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {4215#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {4216#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} is VALID [2018-11-18 23:13:09,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {4216#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4217#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:13:09,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {4217#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} assume true; {4217#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} is VALID [2018-11-18 23:13:09,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {4217#(and (or (<= (* 5 main_~i~0) 9) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0))) (= ~SIZE~0 (* 5 (div ~SIZE~0 5))) (<= 2 ~SIZE~0) (<= (* 5 main_~i~0) 10))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {4218#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:13:09,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {4218#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)))} ~i~0 := 0; {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:09,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume true; {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:09,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:09,611 INFO L256 TraceCheckUtils]: 25: Hoare triple {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {4211#true} is VALID [2018-11-18 23:13:09,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {4211#true} ~cond := #in~cond; {4211#true} is VALID [2018-11-18 23:13:09,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {4211#true} assume !(0 == ~cond); {4211#true} is VALID [2018-11-18 23:13:09,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {4211#true} assume true; {4211#true} is VALID [2018-11-18 23:13:09,613 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {4211#true} {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #95#return; {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:09,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} havoc #t~mem9; {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:09,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {4219#(and (<= (* 5 (div ~SIZE~0 5)) 5) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 12)))) main_~DEFAULTVAL~0)) (< 0 (div ~SIZE~0 5)) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:13:09,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} assume true; {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:13:09,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:13:09,616 INFO L256 TraceCheckUtils]: 34: Hoare triple {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {4211#true} is VALID [2018-11-18 23:13:09,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {4211#true} ~cond := #in~cond; {4211#true} is VALID [2018-11-18 23:13:09,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {4211#true} assume !(0 == ~cond); {4211#true} is VALID [2018-11-18 23:13:09,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {4211#true} assume true; {4211#true} is VALID [2018-11-18 23:13:09,617 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4211#true} {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} #95#return; {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:13:09,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} havoc #t~mem9; {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} is VALID [2018-11-18 23:13:09,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {4220#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12)))) main_~DEFAULTVAL~0)) (<= (* 5 (div ~SIZE~0 5)) 5) (< 0 (div ~SIZE~0 5)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4221#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:13:09,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {4221#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} assume true; {4221#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:13:09,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {4221#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4222#(not (= |main_#t~mem9| main_~DEFAULTVAL~0))} is VALID [2018-11-18 23:13:09,620 INFO L256 TraceCheckUtils]: 43: Hoare triple {4222#(not (= |main_#t~mem9| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {4223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:13:09,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {4223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:13:09,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {4224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4212#false} is VALID [2018-11-18 23:13:09,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {4212#false} assume !false; {4212#false} is VALID [2018-11-18 23:13:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:13:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:13:09,631 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-18 23:13:09,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:09,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:13:09,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:13:09,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:13:09,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 23:13:09,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 23:13:09,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:09,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 23:13:09,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-18 23:13:09,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:09,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-18 23:13:09,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:09,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-18 23:13:09,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:09,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 23:13:10,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-18 23:13:10,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 23:13:10,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:10,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:10,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:10,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2018-11-18 23:13:10,469 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:10,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {4211#true} call ULTIMATE.init(); {4211#true} is VALID [2018-11-18 23:13:10,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {4211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4211#true} is VALID [2018-11-18 23:13:10,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {4211#true} assume true; {4211#true} is VALID [2018-11-18 23:13:10,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4211#true} {4211#true} #97#return; {4211#true} is VALID [2018-11-18 23:13:10,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {4211#true} call #t~ret10 := main(); {4211#true} is VALID [2018-11-18 23:13:10,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {4211#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4211#true} is VALID [2018-11-18 23:13:10,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {4211#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {4246#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {4246#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {4250#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {4272#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {4285#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,569 INFO L256 TraceCheckUtils]: 25: Hoare triple {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} ~cond := #in~cond; {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} assume !(0 == ~cond); {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} assume true; {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,571 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #95#return; {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem9; {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {4298#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,576 INFO L256 TraceCheckUtils]: 34: Hoare triple {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} ~cond := #in~cond; {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,578 INFO L273 TraceCheckUtils]: 36: Hoare triple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} assume !(0 == ~cond); {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} assume true; {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} is VALID [2018-11-18 23:13:10,579 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4308#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (and (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 16))))} {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #95#return; {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem9; {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {4327#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4355#(and (= main_~i~0 2) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {4355#(and (= main_~i~0 2) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume true; {4355#(and (= main_~i~0 2) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {4355#(and (= main_~i~0 2) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4362#(and (<= 10 |main_#t~mem9|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-18 23:13:10,591 INFO L256 TraceCheckUtils]: 43: Hoare triple {4362#(and (<= 10 |main_#t~mem9|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {4366#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:13:10,591 INFO L273 TraceCheckUtils]: 44: Hoare triple {4366#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4370#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:13:10,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {4370#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4212#false} is VALID [2018-11-18 23:13:10,592 INFO L273 TraceCheckUtils]: 46: Hoare triple {4212#false} assume !false; {4212#false} is VALID [2018-11-18 23:13:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:13:10,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:13:10,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-18 23:13:10,618 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-11-18 23:13:10,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:10,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 23:13:10,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:10,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 23:13:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 23:13:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-11-18 23:13:10,718 INFO L87 Difference]: Start difference. First operand 194 states and 243 transitions. Second operand 25 states. [2018-11-18 23:13:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:43,411 INFO L93 Difference]: Finished difference Result 399 states and 499 transitions. [2018-11-18 23:13:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 23:13:43,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-11-18 23:13:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:13:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 211 transitions. [2018-11-18 23:13:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:13:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 211 transitions. [2018-11-18 23:13:43,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 211 transitions. [2018-11-18 23:13:44,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:44,137 INFO L225 Difference]: With dead ends: 399 [2018-11-18 23:13:44,137 INFO L226 Difference]: Without dead ends: 397 [2018-11-18 23:13:44,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=417, Invalid=2553, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 23:13:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-18 23:13:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 304. [2018-11-18 23:13:45,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:45,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 304 states. [2018-11-18 23:13:45,478 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 304 states. [2018-11-18 23:13:45,478 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 304 states. [2018-11-18 23:13:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:45,496 INFO L93 Difference]: Finished difference Result 397 states and 496 transitions. [2018-11-18 23:13:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2018-11-18 23:13:45,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:45,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:45,498 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 397 states. [2018-11-18 23:13:45,498 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 397 states. [2018-11-18 23:13:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:45,517 INFO L93 Difference]: Finished difference Result 397 states and 496 transitions. [2018-11-18 23:13:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2018-11-18 23:13:45,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:45,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:45,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:45,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-18 23:13:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 377 transitions. [2018-11-18 23:13:45,530 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 377 transitions. Word has length 47 [2018-11-18 23:13:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:45,530 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 377 transitions. [2018-11-18 23:13:45,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 23:13:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 377 transitions. [2018-11-18 23:13:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 23:13:45,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:45,532 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:13:45,532 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:45,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1103408156, now seen corresponding path program 1 times [2018-11-18 23:13:45,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:45,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:45,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:45,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:45,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:46,102 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-11-18 23:13:46,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {6110#true} call ULTIMATE.init(); {6110#true} is VALID [2018-11-18 23:13:46,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {6110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6110#true} is VALID [2018-11-18 23:13:46,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {6110#true} assume true; {6110#true} is VALID [2018-11-18 23:13:46,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6110#true} {6110#true} #97#return; {6110#true} is VALID [2018-11-18 23:13:46,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {6110#true} call #t~ret10 := main(); {6110#true} is VALID [2018-11-18 23:13:46,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {6110#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6110#true} is VALID [2018-11-18 23:13:46,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {6110#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {6110#true} is VALID [2018-11-18 23:13:46,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {6110#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {6112#(= main_~i~0 1)} is VALID [2018-11-18 23:13:46,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {6112#(= main_~i~0 1)} assume true; {6112#(= main_~i~0 1)} is VALID [2018-11-18 23:13:46,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {6112#(= main_~i~0 1)} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6112#(= main_~i~0 1)} is VALID [2018-11-18 23:13:46,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {6112#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {6112#(= main_~i~0 1)} is VALID [2018-11-18 23:13:46,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {6112#(= main_~i~0 1)} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6112#(= main_~i~0 1)} is VALID [2018-11-18 23:13:46,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {6112#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} is VALID [2018-11-18 23:13:46,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {6113#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 20 main_~i~0) (- 16))))) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6114#(and (not (= (* 20 main_~i~0) 20)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))))} is VALID [2018-11-18 23:13:46,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {6114#(and (not (= (* 20 main_~i~0) 20)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))))} assume true; {6114#(and (not (= (* 20 main_~i~0) 20)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))))} is VALID [2018-11-18 23:13:46,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {6114#(and (not (= (* 20 main_~i~0) 20)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6114#(and (not (= (* 20 main_~i~0) 20)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))))} is VALID [2018-11-18 23:13:46,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {6114#(and (not (= (* 20 main_~i~0) 20)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {6115#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {6115#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6115#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {6115#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} assume true; {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} is VALID [2018-11-18 23:13:46,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {6116#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16))))))} ~i~0 := 0; {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:46,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} assume true; {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:46,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:46,600 INFO L256 TraceCheckUtils]: 37: Hoare triple {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {6110#true} is VALID [2018-11-18 23:13:46,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {6110#true} ~cond := #in~cond; {6110#true} is VALID [2018-11-18 23:13:46,600 INFO L273 TraceCheckUtils]: 39: Hoare triple {6110#true} assume !(0 == ~cond); {6110#true} is VALID [2018-11-18 23:13:46,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {6110#true} assume true; {6110#true} is VALID [2018-11-18 23:13:46,602 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6110#true} {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} #95#return; {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:46,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} havoc #t~mem9; {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:46,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {6117#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 5) (- 16)))))) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6118#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:13:46,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {6118#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume true; {6118#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:13:46,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {6118#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6119#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:13:46,607 INFO L256 TraceCheckUtils]: 46: Hoare triple {6119#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {6120#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:13:46,607 INFO L273 TraceCheckUtils]: 47: Hoare triple {6120#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6121#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:13:46,608 INFO L273 TraceCheckUtils]: 48: Hoare triple {6121#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6111#false} is VALID [2018-11-18 23:13:46,608 INFO L273 TraceCheckUtils]: 49: Hoare triple {6111#false} assume !false; {6111#false} is VALID [2018-11-18 23:13:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:13:46,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:13:46,617 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-18 23:13:46,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:46,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:13:46,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:13:46,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 23:13:46,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-18 23:13:46,794 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:46,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:13:46,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:46,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:13:46,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:13:46,890 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:46,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:13:46,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:46,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:13:46,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:46,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-18 23:13:46,994 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:47,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 23:13:47,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 23:13:47,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-18 23:13:47,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-18 23:13:47,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 62 [2018-11-18 23:13:47,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:26 [2018-11-18 23:13:47,175 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:47,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-18 23:13:47,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 62 [2018-11-18 23:13:47,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-18 23:13:47,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-18 23:13:47,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 110 [2018-11-18 23:13:47,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2018-11-18 23:13:47,438 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:47,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-18 23:13:47,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 110 [2018-11-18 23:13:47,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2018-11-18 23:13:47,526 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:47,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-18 23:13:47,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:47,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 116 [2018-11-18 23:13:47,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:47,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:13:47,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-11-18 23:13:51,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-11-18 23:13:51,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:51,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:51,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:51,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:51,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:51,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 55 [2018-11-18 23:13:51,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:51,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:51,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:51,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:4 [2018-11-18 23:13:51,297 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:51,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {6110#true} call ULTIMATE.init(); {6110#true} is VALID [2018-11-18 23:13:51,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {6110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6110#true} is VALID [2018-11-18 23:13:51,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {6110#true} assume true; {6110#true} is VALID [2018-11-18 23:13:51,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6110#true} {6110#true} #97#return; {6110#true} is VALID [2018-11-18 23:13:51,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {6110#true} call #t~ret10 := main(); {6110#true} is VALID [2018-11-18 23:13:51,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {6110#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6110#true} is VALID [2018-11-18 23:13:51,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {6110#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {6143#(= |main_~#a~0.offset| 0)} is VALID [2018-11-18 23:13:51,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {6143#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then ~SIZE~0 % 5 - 5 else ~SIZE~0 % 5) then 1 else 0);~i~0 := 1; {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {6147#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {6163#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {6182#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {6182#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume true; {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 5), 4); {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {6186#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 4), 4); {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 3), 4); {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 2), 4); {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call #t~ret7 := ReadFromPort();assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~value~0 := #t~ret7;havoc #t~ret7; {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-18 23:13:51,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {6202#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) main_~FIXEDVAL~0) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (5 * ~i~0 - 1), 4); {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume true; {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 5 then 1 + ~SIZE~0 / 5 else ~SIZE~0 / 5)); {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,371 INFO L273 TraceCheckUtils]: 34: Hoare triple {6221#(and (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 main_~i~0) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,376 INFO L256 TraceCheckUtils]: 37: Hoare triple {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} is VALID [2018-11-18 23:13:51,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} ~cond := #in~cond; {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} is VALID [2018-11-18 23:13:51,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} assume !(0 == ~cond); {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} is VALID [2018-11-18 23:13:51,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} assume true; {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} is VALID [2018-11-18 23:13:51,379 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6244#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 4)))) (<= 2 v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 20 v_prenex_1) (- 16))))))} {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #95#return; {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,380 INFO L273 TraceCheckUtils]: 42: Hoare triple {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem9; {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {6234#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6263#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,382 INFO L273 TraceCheckUtils]: 44: Hoare triple {6263#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume true; {6263#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 23:13:51,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {6263#(and (exists ((v_prenex_1 Int)) (and (<= 2 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 16))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 20 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6119#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} is VALID [2018-11-18 23:13:51,385 INFO L256 TraceCheckUtils]: 46: Hoare triple {6119#(not (= main_~DEFAULTVAL~0 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 != ~DEFAULTVAL~0 then 1 else 0)); {6273#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:13:51,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {6273#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6277#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:13:51,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {6277#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6111#false} is VALID [2018-11-18 23:13:51,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {6111#false} assume !false; {6111#false} is VALID [2018-11-18 23:13:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:13:51,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:13:51,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2018-11-18 23:13:51,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-18 23:13:51,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:51,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 23:13:51,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:51,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 23:13:51,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 23:13:51,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=452, Unknown=2, NotChecked=0, Total=552 [2018-11-18 23:13:51,635 INFO L87 Difference]: Start difference. First operand 304 states and 377 transitions. Second operand 24 states.