java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:20:01,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:20:01,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:20:01,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:20:01,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:20:01,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:20:01,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:20:01,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:20:01,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:20:01,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:20:01,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:20:01,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:20:01,989 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:20:01,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:20:01,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:20:01,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:20:01,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:20:02,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:20:02,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:20:02,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:20:02,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:20:02,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:20:02,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:20:02,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:20:02,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:20:02,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:20:02,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:20:02,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:20:02,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:20:02,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:20:02,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:20:02,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:20:02,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:20:02,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:20:02,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:20:02,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:20:02,020 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:20:02,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:20:02,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:20:02,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:20:02,048 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:20:02,049 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:20:02,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:20:02,049 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:20:02,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:20:02,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:20:02,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:20:02,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:20:02,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:20:02,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:20:02,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:20:02,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:20:02,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:20:02,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:20:02,053 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:20:02,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:20:02,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:20:02,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:20:02,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:20:02,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:20:02,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:20:02,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:20:02,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:20:02,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:20:02,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:20:02,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:20:02,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:20:02,057 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:20:02,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:20:02,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:20:02,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:20:02,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:20:02,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:20:02,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr4_true-unreach-call.i [2018-11-23 12:20:02,199 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa846fe3/c7c58c1b7a424d1abb48cd9d34b9bab7/FLAG7a7195612 [2018-11-23 12:20:02,632 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:20:02,632 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr4_true-unreach-call.i [2018-11-23 12:20:02,640 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa846fe3/c7c58c1b7a424d1abb48cd9d34b9bab7/FLAG7a7195612 [2018-11-23 12:20:03,002 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa846fe3/c7c58c1b7a424d1abb48cd9d34b9bab7 [2018-11-23 12:20:03,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:20:03,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:20:03,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:20:03,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:20:03,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:20:03,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bec00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03, skipping insertion in model container [2018-11-23 12:20:03,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:20:03,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:20:03,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:20:03,266 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:20:03,321 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:20:03,352 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:20:03,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03 WrapperNode [2018-11-23 12:20:03,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:20:03,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:20:03,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:20:03,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:20:03,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:20:03,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:20:03,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:20:03,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:20:03,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... [2018-11-23 12:20:03,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:20:03,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:20:03,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:20:03,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:20:03,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:20:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:20:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:20:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:20:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:20:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-23 12:20:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:20:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:20:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:20:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:20:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:20:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:20:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:20:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:20:04,685 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:20:04,685 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:20:04,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:20:04 BoogieIcfgContainer [2018-11-23 12:20:04,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:20:04,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:20:04,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:20:04,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:20:04,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:20:03" (1/3) ... [2018-11-23 12:20:04,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d925e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:20:04, skipping insertion in model container [2018-11-23 12:20:04,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:03" (2/3) ... [2018-11-23 12:20:04,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d925e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:20:04, skipping insertion in model container [2018-11-23 12:20:04,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:20:04" (3/3) ... [2018-11-23 12:20:04,696 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr4_true-unreach-call.i [2018-11-23 12:20:04,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:20:04,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:20:04,736 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:20:04,775 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:20:04,776 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:20:04,777 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:20:04,777 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:20:04,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:20:04,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:20:04,777 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:20:04,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:20:04,778 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:20:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 12:20:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:20:04,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:04,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:04,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:04,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:04,811 INFO L82 PathProgramCache]: Analyzing trace with hash -861869254, now seen corresponding path program 1 times [2018-11-23 12:20:04,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:04,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:04,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:04,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:04,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 12:20:04,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {37#true} is VALID [2018-11-23 12:20:04,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 12:20:04,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #86#return; {37#true} is VALID [2018-11-23 12:20:04,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret9 := main(); {37#true} is VALID [2018-11-23 12:20:04,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-23 12:20:04,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#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; {37#true} is VALID [2018-11-23 12:20:04,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {37#true} is VALID [2018-11-23 12:20:04,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 12:20:04,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-23 12:20:04,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38#false} is VALID [2018-11-23 12:20:04,983 INFO L256 TraceCheckUtils]: 11: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {38#false} is VALID [2018-11-23 12:20:04,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 12:20:04,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-23 12:20:04,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 12:20:04,988 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-23 12:20:04,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:20:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:20:04,995 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:20:04,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:05,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:20:05,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:05,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:20:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:20:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:20:05,072 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 12:20:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:05,190 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 12:20:05,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:20:05,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:20:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:20:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-23 12:20:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:20:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-23 12:20:05,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2018-11-23 12:20:05,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:05,469 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:20:05,470 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:20:05,473 INFO L631 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-23 12:20:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:20:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:20:05,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:05,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:20:05,518 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:20:05,518 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:20:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:05,522 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 12:20:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:20:05,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:05,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:05,523 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:20:05,524 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:20:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:05,530 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 12:20:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:20:05,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:05,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:05,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:05,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:20:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:20:05,538 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2018-11-23 12:20:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:05,539 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:20:05,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:20:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:20:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:20:05,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:05,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:05,541 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:05,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash 802784026, now seen corresponding path program 1 times [2018-11-23 12:20:05,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:05,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:05,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:05,889 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-23 12:20:05,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2018-11-23 12:20:05,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {195#true} is VALID [2018-11-23 12:20:05,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2018-11-23 12:20:05,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #86#return; {195#true} is VALID [2018-11-23 12:20:05,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret9 := main(); {195#true} is VALID [2018-11-23 12:20:05,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {195#true} is VALID [2018-11-23 12:20:05,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#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; {197#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:20:05,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {197#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {198#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:05,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {196#false} is VALID [2018-11-23 12:20:05,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#false} ~i~0 := 0; {196#false} is VALID [2018-11-23 12:20:05,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#false} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {196#false} is VALID [2018-11-23 12:20:05,933 INFO L256 TraceCheckUtils]: 11: Hoare triple {196#false} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {196#false} is VALID [2018-11-23 12:20:05,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {196#false} ~cond := #in~cond; {196#false} is VALID [2018-11-23 12:20:05,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {196#false} assume 0 == ~cond; {196#false} is VALID [2018-11-23 12:20:05,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {196#false} assume !false; {196#false} is VALID [2018-11-23 12:20:05,935 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-23 12:20:05,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:20:05,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:20:05,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:20:05,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:05,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:20:06,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:06,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:20:06,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:20:06,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:20:06,042 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:20:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:06,591 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:20:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:20:06,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:20:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:20:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:20:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:20:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:20:06,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:20:06,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:06,722 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:20:06,722 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:20:06,724 INFO L631 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-23 12:20:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:20:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-11-23 12:20:06,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:06,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 29 states. [2018-11-23 12:20:06,746 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 29 states. [2018-11-23 12:20:06,747 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 29 states. [2018-11-23 12:20:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:06,751 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 12:20:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 12:20:06,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:06,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:06,752 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 37 states. [2018-11-23 12:20:06,752 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 37 states. [2018-11-23 12:20:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:06,756 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 12:20:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 12:20:06,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:06,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:06,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:06,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:20:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:20:06,759 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2018-11-23 12:20:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:06,759 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:20:06,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:20:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:20:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:20:06,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:06,761 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:20:06,761 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:06,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1524708290, now seen corresponding path program 1 times [2018-11-23 12:20:06,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:06,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:06,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:06,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:07,524 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-11-23 12:20:08,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:20:08,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {373#true} is VALID [2018-11-23 12:20:08,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:20:08,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #86#return; {373#true} is VALID [2018-11-23 12:20:08,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret9 := main(); {373#true} is VALID [2018-11-23 12:20:08,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {373#true} is VALID [2018-11-23 12:20:08,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#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; {375#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {375#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {376#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0) (or (<= main_~i~0 0) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)))} is VALID [2018-11-23 12:20:08,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0) (or (<= main_~i~0 0) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {376#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0) (or (<= main_~i~0 0) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)))} is VALID [2018-11-23 12:20:08,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0) (or (<= main_~i~0 0) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {377#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (<= main_~i~0 0)) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {378#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {378#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {379#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:08,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {379#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {380#(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-23 12:20:08,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {380#(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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {381#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 12:20:08,209 INFO L256 TraceCheckUtils]: 20: Hoare triple {381#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {382#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:08,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {382#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {383#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:08,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {383#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {374#false} is VALID [2018-11-23 12:20:08,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:20:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:08,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:08,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:20:08,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:08,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:08,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:20:08,624 INFO L478 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-23 12:20:08,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:08,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:08,728 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-23 12:20:08,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 12:20:08,734 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:08,734 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= main_~i~0 1) (= (store |v_#memory_int_20| |main_~#a~0.base| (store (select |v_#memory_int_20| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:08,735 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:08,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 12:20:08,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:08,830 INFO L478 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-23 12:20:08,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:08,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:08,855 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-23 12:20:08,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-23 12:20:08,859 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:08,859 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, main_~FIXEDVAL~0]. (let ((.cse0 (select |v_#memory_int_21| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (not (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= (store |v_#memory_int_21| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 12)) main_~FIXEDVAL~0)) |#memory_int|) (= |main_~#a~0.offset| 0))) [2018-11-23 12:20:08,860 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:08,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 12:20:08,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:08,948 INFO L478 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-23 12:20:08,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:08,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:08,972 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-23 12:20:08,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-23 12:20:08,976 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:08,977 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_22| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (= |#memory_int| (store |v_#memory_int_22| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)) main_~value~0))) (not (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))) [2018-11-23 12:20:08,977 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:09,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-23 12:20:09,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:09,057 INFO L478 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-23 12:20:09,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:09,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:09,076 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-23 12:20:09,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2018-11-23 12:20:09,080 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:09,080 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_23| |main_~#a~0.base|))) (and (not (= main_~DEFAULTVAL~0 (select .cse0 |main_~#a~0.offset|))) (= (store |v_#memory_int_23| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 12) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0))) [2018-11-23 12:20:09,080 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:09,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 12:20:09,151 INFO L478 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-23 12:20:09,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:09,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:09,158 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-23 12:20:09,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 12:20:09,161 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:09,162 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (= .cse0 |main_#t~mem8|) (not (= .cse0 main_~DEFAULTVAL~0)))) [2018-11-23 12:20:09,162 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) [2018-11-23 12:20:09,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:20:09,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {373#true} is VALID [2018-11-23 12:20:09,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:20:09,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #86#return; {373#true} is VALID [2018-11-23 12:20:09,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret9 := main(); {373#true} is VALID [2018-11-23 12:20:09,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {373#true} is VALID [2018-11-23 12:20:09,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#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; {405#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:20:09,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {405#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {409#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {409#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {409#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {409#(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 * (4 * ~i~0 - 4), 4); {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= 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; {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= 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 * (4 * ~i~0 - 3), 4); {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= 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; {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= 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 * (4 * ~i~0 - 2), 4); {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= 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; {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {416#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))))) (= 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 * (4 * ~i~0 - 1), 4); {379#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {379#(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; {379#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {379#(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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {379#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:09,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {379#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {380#(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-23 12:20:09,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {380#(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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {381#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 12:20:09,234 INFO L256 TraceCheckUtils]: 20: Hoare triple {381#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {450#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:09,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {450#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {454#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:09,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {454#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {374#false} is VALID [2018-11-23 12:20:09,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:20:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:09,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:09,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-11-23 12:20:09,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 12:20:09,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:09,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:20:09,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:09,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:20:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:20:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:20:09,399 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 16 states. [2018-11-23 12:20:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:12,061 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:20:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:20:12,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 12:20:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:20:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2018-11-23 12:20:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:20:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2018-11-23 12:20:12,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 101 transitions. [2018-11-23 12:20:12,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:12,253 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:20:12,254 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:20:12,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:20:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:20:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2018-11-23 12:20:12,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:12,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 45 states. [2018-11-23 12:20:12,318 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 45 states. [2018-11-23 12:20:12,319 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 45 states. [2018-11-23 12:20:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:12,325 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-11-23 12:20:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2018-11-23 12:20:12,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:12,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:12,327 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 77 states. [2018-11-23 12:20:12,327 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 77 states. [2018-11-23 12:20:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:12,333 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-11-23 12:20:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2018-11-23 12:20:12,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:12,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:12,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:12,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:20:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 12:20:12,338 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 24 [2018-11-23 12:20:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:12,339 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 12:20:12,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:20:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-23 12:20:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:20:12,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:12,340 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:20:12,341 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:12,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1490395328, now seen corresponding path program 1 times [2018-11-23 12:20:12,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:12,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:12,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:12,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:12,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:13,138 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-11-23 12:20:13,308 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-11-23 12:20:13,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {782#true} call ULTIMATE.init(); {782#true} is VALID [2018-11-23 12:20:13,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {782#true} is VALID [2018-11-23 12:20:13,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {782#true} assume true; {782#true} is VALID [2018-11-23 12:20:13,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {782#true} {782#true} #86#return; {782#true} is VALID [2018-11-23 12:20:13,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {782#true} call #t~ret9 := main(); {782#true} is VALID [2018-11-23 12:20:13,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {782#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {782#true} is VALID [2018-11-23 12:20:13,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#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; {784#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {784#(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 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {785#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))))} is VALID [2018-11-23 12:20:13,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {785#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {785#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))))} is VALID [2018-11-23 12:20:13,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {785#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {786#(and (or (and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0))) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {786#(and (or (and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0))) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 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; {786#(and (or (and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0))) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {786#(and (or (and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)) main_~FIXEDVAL~0) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0))) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 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 * (4 * ~i~0 - 3), 4); {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 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; {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 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 * (4 * ~i~0 - 2), 4); {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 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; {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 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 * (4 * ~i~0 - 1), 4); {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {787#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16))) main_~DEFAULTVAL~0)) (not (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (or (and (<= 2 ~SIZE~0) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) 16)) (= 16 (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {788#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {788#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {789#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:13,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {789#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {790#(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-23 12:20:13,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#(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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {791#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:13,792 INFO L256 TraceCheckUtils]: 20: Hoare triple {791#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {792#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:13,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {792#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {793#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:13,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {793#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {783#false} is VALID [2018-11-23 12:20:13,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {783#false} assume !false; {783#false} is VALID [2018-11-23 12:20:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:13,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:13,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:20:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:13,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:13,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:20:13,934 INFO L478 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-23 12:20:13,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:13,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:13,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:13,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 12:20:14,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 12:20:14,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,020 INFO L478 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 31 treesize of output 48 [2018-11-23 12:20:14,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-23 12:20:14,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-11-23 12:20:14,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 88 [2018-11-23 12:20:14,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,191 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-23 12:20:14,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:43 [2018-11-23 12:20:14,196 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:14,196 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_26| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (let ((.cse2 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 16))))) (and (= (store |v_#memory_int_26| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)) main_~value~0)) |#memory_int|) (= main_~i~0 1) (<= 10 .cse2) (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12))) .cse2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:14,197 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (let ((.cse2 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 16))))) (and (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12))) .cse2) (= main_~i~0 1) (<= 10 .cse2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:14,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-23 12:20:14,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 50 [2018-11-23 12:20:14,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,259 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-23 12:20:14,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-11-23 12:20:14,262 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:14,263 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, main_~value~0]. (let ((.cse1 (select |v_#memory_int_27| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 |main_~#a~0.offset|))) (and (<= 10 .cse0) (= .cse0 (select .cse1 (+ |main_~#a~0.offset| 4))) (= |#memory_int| (store |v_#memory_int_27| |main_~#a~0.base| (store .cse1 (+ |main_~#a~0.offset| 12) main_~value~0))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:14,263 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 |main_~#a~0.offset|))) (and (<= 10 .cse0) (= (select .cse1 (+ |main_~#a~0.offset| 4)) .cse0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:14,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 12:20:14,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 12:20:14,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,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-23 12:20:14,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2018-11-23 12:20:14,390 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:14,391 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (<= 10 .cse1) (<= .cse1 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:14,391 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:14,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {782#true} call ULTIMATE.init(); {782#true} is VALID [2018-11-23 12:20:14,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {782#true} is VALID [2018-11-23 12:20:14,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {782#true} assume true; {782#true} is VALID [2018-11-23 12:20:14,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {782#true} {782#true} #86#return; {782#true} is VALID [2018-11-23 12:20:14,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {782#true} call #t~ret9 := main(); {782#true} is VALID [2018-11-23 12:20:14,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {782#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {782#true} is VALID [2018-11-23 12:20:14,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#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; {815#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {819#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {819#(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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {819#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#(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 * (4 * ~i~0 - 4), 4); {826#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {826#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= 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; {826#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {826#(and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= 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 * (4 * ~i~0 - 3), 4); {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |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; {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |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 * (4 * ~i~0 - 2), 4); {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |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; {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,494 INFO L273 TraceCheckUtils]: 15: Hoare triple {833#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)))) (= |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 * (4 * ~i~0 - 1), 4); {846#(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| 4)) (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-23 12:20:14,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {846#(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| 4)) (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; {846#(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| 4)) (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-23 12:20:14,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {846#(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| 4)) (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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {846#(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| 4)) (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-23 12:20:14,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {846#(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| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {856#(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| 4)) (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-23 12:20:14,513 INFO L273 TraceCheckUtils]: 19: Hoare triple {856#(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| 4)) (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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {860#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:14,514 INFO L256 TraceCheckUtils]: 20: Hoare triple {860#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {864#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:14,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {864#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {868#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:14,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {868#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {783#false} is VALID [2018-11-23 12:20:14,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {783#false} assume !false; {783#false} is VALID [2018-11-23 12:20:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:14,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:14,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 12:20:14,538 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-23 12:20:14,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:14,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:20:14,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:14,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:20:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:20:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:20:14,626 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 21 states. [2018-11-23 12:20:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:18,810 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-11-23 12:20:18,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:20:18,810 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-23 12:20:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 12:20:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 12:20:18,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2018-11-23 12:20:19,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:19,017 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:20:19,017 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:20:19,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:20:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:20:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2018-11-23 12:20:19,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:19,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 65 states. [2018-11-23 12:20:19,162 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 65 states. [2018-11-23 12:20:19,163 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 65 states. [2018-11-23 12:20:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:19,170 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2018-11-23 12:20:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2018-11-23 12:20:19,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:19,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:19,172 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 92 states. [2018-11-23 12:20:19,172 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 92 states. [2018-11-23 12:20:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:19,178 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2018-11-23 12:20:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2018-11-23 12:20:19,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:19,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:19,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:19,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:20:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2018-11-23 12:20:19,202 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 24 [2018-11-23 12:20:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-23 12:20:19,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:20:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2018-11-23 12:20:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:20:19,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:19,213 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:20:19,217 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:19,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:19,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2004587151, now seen corresponding path program 1 times [2018-11-23 12:20:19,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:19,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:19,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:20,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {1289#true} call ULTIMATE.init(); {1289#true} is VALID [2018-11-23 12:20:20,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {1289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1289#true} is VALID [2018-11-23 12:20:20,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2018-11-23 12:20:20,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1289#true} #86#return; {1289#true} is VALID [2018-11-23 12:20:20,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {1289#true} call #t~ret9 := main(); {1289#true} is VALID [2018-11-23 12:20:20,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {1289#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1289#true} is VALID [2018-11-23 12:20:20,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {1289#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; {1291#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:20,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {1291#(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 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {1292#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (< 0 (+ ~SIZE~0 1)))} is VALID [2018-11-23 12:20:20,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {1292#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (< 0 main_~i~0) (<= 2 ~SIZE~0)) (< 0 (+ ~SIZE~0 1)))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1293#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:20,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {1293#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {1293#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:20,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {1293#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1293#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:20,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {1293#(and (or (and (= main_~i~0 1) (= |main_~#a~0.offset| 0) (or (and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12))))) (<= main_~i~0 0)) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} is VALID [2018-11-23 12:20:20,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} is VALID [2018-11-23 12:20:20,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} is VALID [2018-11-23 12:20:20,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} is VALID [2018-11-23 12:20:20,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} is VALID [2018-11-23 12:20:20,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {1294#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0) (or (and (= main_~i~0 1) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (not (= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 12)))) (= |main_~#a~0.offset| 0)) (<= main_~i~0 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1295#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= main_~i~0 2) (<= 4 ~SIZE~0) (= |main_~#a~0.offset| 0))))} is VALID [2018-11-23 12:20:20,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {1295#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= main_~i~0 2) (<= 4 ~SIZE~0) (= |main_~#a~0.offset| 0))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {1296#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:20,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {1296#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:20,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:20,451 INFO L256 TraceCheckUtils]: 20: Hoare triple {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {1289#true} is VALID [2018-11-23 12:20:20,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2018-11-23 12:20:20,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2018-11-23 12:20:20,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {1289#true} assume true; {1289#true} is VALID [2018-11-23 12:20:20,468 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1289#true} {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #90#return; {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:20,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:20,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {1297#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) ~SIZE~0) main_~DEFAULTVAL~0)) (<= ~SIZE~0 4) (<= 4 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1298#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (+ (* 4 main_~i~0) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:20,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {1298#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= ~SIZE~0 (+ (* 4 main_~i~0) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1299#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:20,500 INFO L256 TraceCheckUtils]: 28: Hoare triple {1299#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {1300#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:20,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {1300#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1301#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:20,501 INFO L273 TraceCheckUtils]: 30: Hoare triple {1301#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1290#false} is VALID [2018-11-23 12:20:20,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {1290#false} assume !false; {1290#false} is VALID [2018-11-23 12:20:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:20,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:20,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:20:20,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:20,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:20,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:20:20,706 INFO L478 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-23 12:20:20,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:20,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:20,723 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-23 12:20:20,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 12:20:20,728 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:20,729 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, main_~FIXEDVAL~0]. (and (= |#memory_int| (store |v_#memory_int_28| |main_~#a~0.base| (store (select |v_#memory_int_28| |main_~#a~0.base|) (+ (* 16 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)) [2018-11-23 12:20:20,729 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:20,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 12:20:20,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:20,801 INFO L478 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-23 12:20:20,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:20,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:20,825 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-23 12:20:20,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 12:20:20,830 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:20,830 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_29| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (<= 10 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= (store |v_#memory_int_29| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:20,830 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:20,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 12:20:20,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:20,873 INFO L478 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-23 12:20:20,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:20,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:20,891 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-23 12:20:20,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-23 12:20:20,894 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:20,894 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_30| |main_~#a~0.base|))) (and (= (store |v_#memory_int_30| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 12) main_~value~0)) |#memory_int|) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:20,894 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:21,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:20:21,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-11-23 12:20:21,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:21,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:21,366 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-23 12:20:21,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:20:21,368 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:21,369 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 4))) (and (<= 10 .cse0) (<= .cse0 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:21,369 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:21,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {1289#true} call ULTIMATE.init(); {1289#true} is VALID [2018-11-23 12:20:21,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {1289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1289#true} is VALID [2018-11-23 12:20:21,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2018-11-23 12:20:21,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1289#true} #86#return; {1289#true} is VALID [2018-11-23 12:20:21,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {1289#true} call #t~ret9 := main(); {1289#true} is VALID [2018-11-23 12:20:21,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {1289#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1289#true} is VALID [2018-11-23 12:20:21,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {1289#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; {1323#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {1323#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {1327#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {1327#(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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1327#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {1327#(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 * (4 * ~i~0 - 4), 4); {1327#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1327#(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; {1327#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {1327#(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 * (4 * ~i~0 - 3), 4); {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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; {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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 * (4 * ~i~0 - 2), 4); {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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; {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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 * (4 * ~i~0 - 1), 4); {1353#(and (<= 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-23 12:20:21,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {1353#(and (<= 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; {1353#(and (<= 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-23 12:20:21,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {1353#(and (<= 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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {1353#(and (<= 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-23 12:20:21,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {1353#(and (<= 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; {1363#(and (<= 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-23 12:20:21,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {1363#(and (<= 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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1363#(and (<= 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-23 12:20:21,493 INFO L256 TraceCheckUtils]: 20: Hoare triple {1363#(and (<= 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~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:21,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:21,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} assume !(0 == ~cond); {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:21,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} assume true; {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:21,514 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1370#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} {1363#(and (<= 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))} #90#return; {1363#(and (<= 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-23 12:20:21,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {1363#(and (<= 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~mem8; {1363#(and (<= 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-23 12:20:21,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {1363#(and (<= 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~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {1340#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1392#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:21,517 INFO L256 TraceCheckUtils]: 28: Hoare triple {1392#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {1396#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:21,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {1396#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1400#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:21,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {1400#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1290#false} is VALID [2018-11-23 12:20:21,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {1290#false} assume !false; {1290#false} is VALID [2018-11-23 12:20:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:21,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 12:20:21,552 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-11-23 12:20:21,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:21,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:20:21,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:21,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:20:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:20:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:20:21,687 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 22 states. [2018-11-23 12:20:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:28,345 INFO L93 Difference]: Finished difference Result 218 states and 279 transitions. [2018-11-23 12:20:28,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:20:28,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-11-23 12:20:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:20:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 167 transitions. [2018-11-23 12:20:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:20:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 167 transitions. [2018-11-23 12:20:28,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 167 transitions. [2018-11-23 12:20:28,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:28,657 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:20:28,658 INFO L226 Difference]: Without dead ends: 216 [2018-11-23 12:20:28,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:20:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-23 12:20:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 71. [2018-11-23 12:20:28,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:28,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 71 states. [2018-11-23 12:20:28,937 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 71 states. [2018-11-23 12:20:28,937 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 71 states. [2018-11-23 12:20:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:28,947 INFO L93 Difference]: Finished difference Result 216 states and 276 transitions. [2018-11-23 12:20:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 276 transitions. [2018-11-23 12:20:28,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:28,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:28,949 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 216 states. [2018-11-23 12:20:28,949 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 216 states. [2018-11-23 12:20:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:28,959 INFO L93 Difference]: Finished difference Result 216 states and 276 transitions. [2018-11-23 12:20:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 276 transitions. [2018-11-23 12:20:28,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:28,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:28,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:28,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:20:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2018-11-23 12:20:28,964 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 32 [2018-11-23 12:20:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:28,964 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-11-23 12:20:28,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:20:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2018-11-23 12:20:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:20:28,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:28,966 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-23 12:20:28,966 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:28,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash -899994716, now seen corresponding path program 2 times [2018-11-23 12:20:28,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:28,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:28,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:28,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:28,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:29,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {2255#true} call ULTIMATE.init(); {2255#true} is VALID [2018-11-23 12:20:29,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {2255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2255#true} is VALID [2018-11-23 12:20:29,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {2255#true} assume true; {2255#true} is VALID [2018-11-23 12:20:29,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} #86#return; {2255#true} is VALID [2018-11-23 12:20:29,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {2255#true} call #t~ret9 := main(); {2255#true} is VALID [2018-11-23 12:20:29,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {2255#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2255#true} is VALID [2018-11-23 12:20:29,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {2255#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; {2257#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:20:29,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {2257#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {2258#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {2259#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {2259#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1) (<= 2 ~SIZE~0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {2259#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {2259#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1) (<= 2 ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {2259#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {2259#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1) (<= 2 ~SIZE~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2260#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= (* 4 main_~i~0) 8) (or (<= (* 4 main_~i~0) 7) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:29,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {2260#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= (* 4 main_~i~0) 8) (or (<= (* 4 main_~i~0) 7) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))) (<= 2 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {2261#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)))} is VALID [2018-11-23 12:20:29,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {2261#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)))} ~i~0 := 0; {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:29,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:29,500 INFO L256 TraceCheckUtils]: 20: Hoare triple {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {2255#true} is VALID [2018-11-23 12:20:29,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {2255#true} ~cond := #in~cond; {2255#true} is VALID [2018-11-23 12:20:29,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {2255#true} assume !(0 == ~cond); {2255#true} is VALID [2018-11-23 12:20:29,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {2255#true} assume true; {2255#true} is VALID [2018-11-23 12:20:29,502 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2255#true} {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} #90#return; {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:29,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} havoc #t~mem8; {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:29,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {2262#(and (<= (* 4 (div ~SIZE~0 4)) 4) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (<= 1 (div ~SIZE~0 4)) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} is VALID [2018-11-23 12:20:29,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} is VALID [2018-11-23 12:20:29,506 INFO L256 TraceCheckUtils]: 28: Hoare triple {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {2255#true} is VALID [2018-11-23 12:20:29,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {2255#true} ~cond := #in~cond; {2255#true} is VALID [2018-11-23 12:20:29,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {2255#true} assume !(0 == ~cond); {2255#true} is VALID [2018-11-23 12:20:29,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {2255#true} assume true; {2255#true} is VALID [2018-11-23 12:20:29,508 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2255#true} {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} #90#return; {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} is VALID [2018-11-23 12:20:29,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} havoc #t~mem8; {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} is VALID [2018-11-23 12:20:29,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {2263#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))))) (<= (* 4 (div ~SIZE~0 4)) 4) (<= 1 (div ~SIZE~0 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2264#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:20:29,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {2264#(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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2265#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 12:20:29,520 INFO L256 TraceCheckUtils]: 36: Hoare triple {2265#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {2266#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:29,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {2266#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2267#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:29,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {2267#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2256#false} is VALID [2018-11-23 12:20:29,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {2256#false} assume !false; {2256#false} is VALID [2018-11-23 12:20:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:29,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:29,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:20:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:20:29,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:20:29,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:29,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:29,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:20:29,753 INFO L478 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-23 12:20:29,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:29,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:29,766 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-23 12:20:29,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 12:20:29,769 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:29,769 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |#memory_int| (store |v_#memory_int_31| |main_~#a~0.base| (store (select |v_#memory_int_31| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~value~0))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:29,769 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:29,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 12:20:29,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:29,810 INFO L478 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-23 12:20:29,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:29,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:29,825 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-23 12:20:29,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-23 12:20:29,828 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:29,828 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_32| |main_~#a~0.base|))) (and (= |#memory_int| (store |v_#memory_int_32| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 12) main_~value~0))) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))) [2018-11-23 12:20:29,829 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:29,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 12:20:29,970 INFO L478 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-23 12:20:29,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:29,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:29,974 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-23 12:20:29,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 12:20:29,976 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:29,976 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 8))) (and (not (= main_~DEFAULTVAL~0 .cse0)) (= .cse0 |main_#t~mem8|))) [2018-11-23 12:20:29,977 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) [2018-11-23 12:20:30,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {2255#true} call ULTIMATE.init(); {2255#true} is VALID [2018-11-23 12:20:30,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {2255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2255#true} is VALID [2018-11-23 12:20:30,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {2255#true} assume true; {2255#true} is VALID [2018-11-23 12:20:30,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} #86#return; {2255#true} is VALID [2018-11-23 12:20:30,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {2255#true} call #t~ret9 := main(); {2255#true} is VALID [2018-11-23 12:20:30,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {2255#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2255#true} is VALID [2018-11-23 12:20:30,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {2255#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; {2289#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:20:30,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {2289#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {2293#(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 * (4 * ~i~0 - 4), 4); {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {2293#(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; {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {2293#(and (= 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 * (4 * ~i~0 - 3), 4); {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {2293#(and (= 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; {2293#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {2293#(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 * (4 * ~i~0 - 2), 4); {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= 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; {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= 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 * (4 * ~i~0 - 1), 4); {2319#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {2319#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2319#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {2319#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {2319#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {2319#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,025 INFO L256 TraceCheckUtils]: 20: Hoare triple {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {2255#true} is VALID [2018-11-23 12:20:30,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {2255#true} ~cond := #in~cond; {2255#true} is VALID [2018-11-23 12:20:30,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {2255#true} assume !(0 == ~cond); {2255#true} is VALID [2018-11-23 12:20:30,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {2255#true} assume true; {2255#true} is VALID [2018-11-23 12:20:30,027 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2255#true} {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #90#return; {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {2329#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,034 INFO L273 TraceCheckUtils]: 27: Hoare triple {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,034 INFO L256 TraceCheckUtils]: 28: Hoare triple {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {2255#true} is VALID [2018-11-23 12:20:30,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {2255#true} ~cond := #in~cond; {2255#true} is VALID [2018-11-23 12:20:30,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {2255#true} assume !(0 == ~cond); {2255#true} is VALID [2018-11-23 12:20:30,034 INFO L273 TraceCheckUtils]: 31: Hoare triple {2255#true} assume true; {2255#true} is VALID [2018-11-23 12:20:30,035 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2255#true} {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #90#return; {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,036 INFO L273 TraceCheckUtils]: 34: Hoare triple {2312#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2378#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:30,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {2378#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2265#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 12:20:30,037 INFO L256 TraceCheckUtils]: 36: Hoare triple {2265#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {2385#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:30,038 INFO L273 TraceCheckUtils]: 37: Hoare triple {2385#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2389#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:30,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2256#false} is VALID [2018-11-23 12:20:30,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {2256#false} assume !false; {2256#false} is VALID [2018-11-23 12:20:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:30,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:30,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-11-23 12:20:30,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-11-23 12:20:30,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:30,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:20:30,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:30,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:20:30,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:20:30,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:20:30,136 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 21 states. [2018-11-23 12:20:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:34,834 INFO L93 Difference]: Finished difference Result 168 states and 218 transitions. [2018-11-23 12:20:34,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:20:34,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-11-23 12:20:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 136 transitions. [2018-11-23 12:20:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 136 transitions. [2018-11-23 12:20:34,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 136 transitions. [2018-11-23 12:20:35,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:35,105 INFO L225 Difference]: With dead ends: 168 [2018-11-23 12:20:35,105 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 12:20:35,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=1304, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:20:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 12:20:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2018-11-23 12:20:35,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:35,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 134 states. [2018-11-23 12:20:35,558 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 134 states. [2018-11-23 12:20:35,558 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 134 states. [2018-11-23 12:20:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:35,566 INFO L93 Difference]: Finished difference Result 166 states and 216 transitions. [2018-11-23 12:20:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2018-11-23 12:20:35,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:35,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:35,567 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 166 states. [2018-11-23 12:20:35,567 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 166 states. [2018-11-23 12:20:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:35,574 INFO L93 Difference]: Finished difference Result 166 states and 216 transitions. [2018-11-23 12:20:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2018-11-23 12:20:35,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:35,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:35,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:35,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 12:20:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2018-11-23 12:20:35,581 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 40 [2018-11-23 12:20:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:35,582 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2018-11-23 12:20:35,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:20:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2018-11-23 12:20:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:20:35,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:35,583 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-23 12:20:35,583 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:35,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1023233318, now seen corresponding path program 1 times [2018-11-23 12:20:35,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:35,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:35,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:36,283 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-11-23 12:20:36,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {3155#true} call ULTIMATE.init(); {3155#true} is VALID [2018-11-23 12:20:36,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {3155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3155#true} is VALID [2018-11-23 12:20:36,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {3155#true} assume true; {3155#true} is VALID [2018-11-23 12:20:36,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3155#true} {3155#true} #86#return; {3155#true} is VALID [2018-11-23 12:20:36,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {3155#true} call #t~ret9 := main(); {3155#true} is VALID [2018-11-23 12:20:36,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {3155#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3155#true} is VALID [2018-11-23 12:20:36,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {3155#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; {3157#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:36,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {3157#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {3158#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {3159#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {3159#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {3159#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {3159#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {3159#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1))} is VALID [2018-11-23 12:20:36,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {3159#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3160#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0))))} is VALID [2018-11-23 12:20:36,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {3160#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (<= (* 4 main_~i~0) (+ ~SIZE~0 2)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {3161#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {3161#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0))} ~i~0 := 0; {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:36,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:36,951 INFO L256 TraceCheckUtils]: 20: Hoare triple {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {3155#true} is VALID [2018-11-23 12:20:36,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2018-11-23 12:20:36,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2018-11-23 12:20:36,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {3155#true} assume true; {3155#true} is VALID [2018-11-23 12:20:36,953 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3155#true} {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} #90#return; {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:36,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} havoc #t~mem8; {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:36,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {3162#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,955 INFO L256 TraceCheckUtils]: 28: Hoare triple {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {3155#true} is VALID [2018-11-23 12:20:36,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2018-11-23 12:20:36,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2018-11-23 12:20:36,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {3155#true} assume true; {3155#true} is VALID [2018-11-23 12:20:36,957 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3155#true} {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} #90#return; {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} havoc #t~mem8; {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {3163#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8)))) main_~DEFAULTVAL~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3164#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,959 INFO L273 TraceCheckUtils]: 35: Hoare triple {3164#(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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3165#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:36,960 INFO L256 TraceCheckUtils]: 36: Hoare triple {3165#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {3166#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:36,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {3166#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3167#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:36,962 INFO L273 TraceCheckUtils]: 38: Hoare triple {3167#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3156#false} is VALID [2018-11-23 12:20:36,962 INFO L273 TraceCheckUtils]: 39: Hoare triple {3156#false} assume !false; {3156#false} is VALID [2018-11-23 12:20:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:36,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:36,966 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-23 12:20:36,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:37,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:37,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:20:37,109 INFO L478 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-23 12:20:37,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:37,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:37,126 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-23 12:20:37,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 12:20:37,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:37,130 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_33|, main_~FIXEDVAL~0]. (and (= main_~i~0 1) (= (store |v_#memory_int_33| |main_~#a~0.base| (store (select |v_#memory_int_33| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0)) |#memory_int|) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:37,130 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:37,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 12:20:37,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:37,263 INFO L478 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-23 12:20:37,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:37,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:37,282 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-23 12:20:37,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-23 12:20:37,286 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:37,286 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_34| |main_~#a~0.base|))) (and (<= 10 (select .cse0 (+ |main_~#a~0.offset| 8))) (= |#memory_int| (store |v_#memory_int_34| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 12) main_~value~0))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:37,286 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:37,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:20:37,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-11-23 12:20:37,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:37,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:37,686 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-23 12:20:37,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:20:37,689 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:37,689 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 8))) (and (<= 10 .cse0) (<= .cse0 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:37,689 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:37,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {3155#true} call ULTIMATE.init(); {3155#true} is VALID [2018-11-23 12:20:37,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {3155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3155#true} is VALID [2018-11-23 12:20:37,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {3155#true} assume true; {3155#true} is VALID [2018-11-23 12:20:37,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3155#true} {3155#true} #86#return; {3155#true} is VALID [2018-11-23 12:20:37,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {3155#true} call #t~ret9 := main(); {3155#true} is VALID [2018-11-23 12:20:37,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {3155#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3155#true} is VALID [2018-11-23 12:20:37,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {3155#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; {3189#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {3189#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {3193#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {3193#(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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {3193#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {3193#(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 * (4 * ~i~0 - 4), 4); {3193#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(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; {3193#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(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 * (4 * ~i~0 - 3), 4); {3193#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {3193#(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; {3193#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {3193#(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 * (4 * ~i~0 - 2), 4); {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |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; {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |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 * (4 * ~i~0 - 1), 4); {3219#(and (<= 10 (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-23 12:20:37,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {3219#(and (<= 10 (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; {3219#(and (<= 10 (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-23 12:20:37,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {3219#(and (<= 10 (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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {3219#(and (<= 10 (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-23 12:20:37,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {3219#(and (<= 10 (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; {3229#(and (<= 10 (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-23 12:20:37,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {3229#(and (<= 10 (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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3229#(and (<= 10 (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-23 12:20:37,781 INFO L256 TraceCheckUtils]: 20: Hoare triple {3229#(and (<= 10 (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~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} ~cond := #in~cond; {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} assume !(0 == ~cond); {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} assume true; {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,784 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} {3229#(and (<= 10 (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))} #90#return; {3229#(and (<= 10 (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-23 12:20:37,785 INFO L273 TraceCheckUtils]: 25: Hoare triple {3229#(and (<= 10 (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~mem8; {3229#(and (<= 10 (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-23 12:20:37,786 INFO L273 TraceCheckUtils]: 26: Hoare triple {3229#(and (<= 10 (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~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,789 INFO L256 TraceCheckUtils]: 28: Hoare triple {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} ~cond := #in~cond; {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} assume !(0 == ~cond); {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} assume true; {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} is VALID [2018-11-23 12:20:37,791 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3236#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 8)))} {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #90#return; {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {3212#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3279#(and (= main_~i~0 2) (<= 10 (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-23 12:20:37,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {3279#(and (= main_~i~0 2) (<= 10 (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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3283#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:37,802 INFO L256 TraceCheckUtils]: 36: Hoare triple {3283#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {3287#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:37,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {3287#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3291#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:37,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {3291#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3156#false} is VALID [2018-11-23 12:20:37,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {3156#false} assume !false; {3156#false} is VALID [2018-11-23 12:20:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:37,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:37,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 12:20:37,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-11-23 12:20:37,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:37,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:20:37,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:37,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:20:37,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:20:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:20:37,908 INFO L87 Difference]: Start difference. First operand 134 states and 176 transitions. Second operand 23 states. [2018-11-23 12:20:50,070 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2018-11-23 12:20:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:51,493 INFO L93 Difference]: Finished difference Result 309 states and 401 transitions. [2018-11-23 12:20:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:20:51,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-11-23 12:20:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:20:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 171 transitions. [2018-11-23 12:20:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:20:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 171 transitions. [2018-11-23 12:20:51,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 171 transitions. [2018-11-23 12:20:51,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:51,856 INFO L225 Difference]: With dead ends: 309 [2018-11-23 12:20:51,856 INFO L226 Difference]: Without dead ends: 307 [2018-11-23 12:20:51,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:20:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-23 12:20:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 206. [2018-11-23 12:20:52,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:52,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand 206 states. [2018-11-23 12:20:52,542 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 206 states. [2018-11-23 12:20:52,542 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 206 states. [2018-11-23 12:20:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:52,553 INFO L93 Difference]: Finished difference Result 307 states and 398 transitions. [2018-11-23 12:20:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 398 transitions. [2018-11-23 12:20:52,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:52,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:52,555 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 307 states. [2018-11-23 12:20:52,555 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 307 states. [2018-11-23 12:20:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:52,568 INFO L93 Difference]: Finished difference Result 307 states and 398 transitions. [2018-11-23 12:20:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 398 transitions. [2018-11-23 12:20:52,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:52,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:52,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:52,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-23 12:20:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2018-11-23 12:20:52,578 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 40 [2018-11-23 12:20:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:52,579 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2018-11-23 12:20:52,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:20:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2018-11-23 12:20:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:20:52,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:52,580 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:20:52,581 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:52,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash -894687797, now seen corresponding path program 1 times [2018-11-23 12:20:52,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:52,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:52,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:52,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:52,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:53,148 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-11-23 12:20:53,755 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2018-11-23 12:20:54,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {4605#true} call ULTIMATE.init(); {4605#true} is VALID [2018-11-23 12:20:54,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {4605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4605#true} is VALID [2018-11-23 12:20:54,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {4605#true} assume true; {4605#true} is VALID [2018-11-23 12:20:54,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4605#true} {4605#true} #86#return; {4605#true} is VALID [2018-11-23 12:20:54,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {4605#true} call #t~ret9 := main(); {4605#true} is VALID [2018-11-23 12:20:54,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {4605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4605#true} is VALID [2018-11-23 12:20:54,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {4605#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; {4607#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {4607#(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 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~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; {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {4608#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~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; {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~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; {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {4609#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4610#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= (* 16 main_~i~0) 16)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0))) (<= (+ (* 4 (div ~SIZE~0 4)) 1) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {4610#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= (* 16 main_~i~0) 16)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0))) (<= (+ (* 4 (div ~SIZE~0 4)) 1) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4611#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= (* 16 main_~i~0) 16)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {4611#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= (* 16 main_~i~0) 16)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {4611#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= (* 16 main_~i~0) 16)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {4611#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (or (and (not (= (* 16 main_~i~0) 16)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (< 0 (+ ~SIZE~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; {4612#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {4612#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {4613#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) ~SIZE~0)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4614#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= main_~i~0 (div ~SIZE~0 4))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {4614#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (<= main_~i~0 (div ~SIZE~0 4))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {4615#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {4615#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,600 INFO L273 TraceCheckUtils]: 28: Hoare triple {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,600 INFO L256 TraceCheckUtils]: 29: Hoare triple {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {4605#true} is VALID [2018-11-23 12:20:54,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#true} ~cond := #in~cond; {4605#true} is VALID [2018-11-23 12:20:54,601 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#true} assume !(0 == ~cond); {4605#true} is VALID [2018-11-23 12:20:54,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#true} assume true; {4605#true} is VALID [2018-11-23 12:20:54,603 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4605#true} {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #90#return; {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {4616#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 12)))) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4617#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:54,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {4617#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4618#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:54,620 INFO L256 TraceCheckUtils]: 37: Hoare triple {4618#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {4619#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:54,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {4619#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4620#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:54,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {4620#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4606#false} is VALID [2018-11-23 12:20:54,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {4606#false} assume !false; {4606#false} is VALID [2018-11-23 12:20:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:54,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:54,629 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-23 12:20:54,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:54,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:54,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:20:54,772 INFO L478 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-23 12:20:54,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:54,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:54,797 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-23 12:20:54,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 12:20:54,805 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:54,805 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, main_~FIXEDVAL~0]. (and (= main_~i~0 1) (= |#memory_int| (store |v_#memory_int_35| |main_~#a~0.base| (store (select |v_#memory_int_35| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)) main_~FIXEDVAL~0))) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:54,805 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:54,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 12:20:54,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:54,884 INFO L478 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-23 12:20:54,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:54,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:54,913 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-23 12:20:54,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 12:20:54,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:54,918 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_36| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (<= 10 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= (store |v_#memory_int_36| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:54,918 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:54,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 12:20:54,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:54,952 INFO L478 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-23 12:20:54,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,253 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-23 12:20:55,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 12:20:55,268 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:55,268 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_37| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (= |#memory_int| (store |v_#memory_int_37| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 4)) main_~value~0))) (= main_~i~0 1) (<= 10 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:55,268 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:55,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 12:20:55,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:55,361 INFO L478 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 21 treesize of output 33 [2018-11-23 12:20:55,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,383 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-23 12:20:55,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-23 12:20:55,388 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:55,389 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_38| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= (store |v_#memory_int_38| |main_~#a~0.base| (store .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:55,389 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:55,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 12:20:55,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:55,420 INFO L478 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 21 treesize of output 33 [2018-11-23 12:20:55,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,444 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-23 12:20:55,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-23 12:20:55,449 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:55,449 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_39| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= (store |v_#memory_int_39| |main_~#a~0.base| (store .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:55,450 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:55,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 12:20:55,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:55,478 INFO L478 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 21 treesize of output 33 [2018-11-23 12:20:55,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,501 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-23 12:20:55,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-23 12:20:55,505 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:55,505 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_40| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (= |#memory_int| (store |v_#memory_int_40| |main_~#a~0.base| (store .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~value~0))) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:55,505 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:55,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 12:20:55,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:55,537 INFO L478 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 21 treesize of output 33 [2018-11-23 12:20:55,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,559 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-23 12:20:55,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2018-11-23 12:20:55,563 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:55,563 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, main_~i~0, main_~value~0]. (let ((.cse0 (select |v_#memory_int_41| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= (store |v_#memory_int_41| |main_~#a~0.base| (store .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 4)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:55,564 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:55,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:20:55,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-11-23 12:20:55,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:55,791 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-23 12:20:55,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:20:55,794 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:55,794 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 4))) (and (<= 10 .cse0) (<= .cse0 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:55,794 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:55,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {4605#true} call ULTIMATE.init(); {4605#true} is VALID [2018-11-23 12:20:55,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {4605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4605#true} is VALID [2018-11-23 12:20:55,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {4605#true} assume true; {4605#true} is VALID [2018-11-23 12:20:55,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4605#true} {4605#true} #86#return; {4605#true} is VALID [2018-11-23 12:20:55,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {4605#true} call #t~ret9 := main(); {4605#true} is VALID [2018-11-23 12:20:55,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {4605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4605#true} is VALID [2018-11-23 12:20:55,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {4605#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; {4642#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {4642#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {4646#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {4646#(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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4646#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {4646#(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 * (4 * ~i~0 - 4), 4); {4646#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {4646#(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; {4646#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {4646#(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 * (4 * ~i~0 - 3), 4); {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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; {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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 * (4 * ~i~0 - 2), 4); {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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; {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |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 * (4 * ~i~0 - 1), 4); {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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 * (4 * ~i~0 - 4), 4); {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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; {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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 * (4 * ~i~0 - 3), 4); {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,964 INFO L273 TraceCheckUtils]: 21: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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; {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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 * (4 * ~i~0 - 2), 4); {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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; {4675#(and (<= 2 main_~i~0) (<= 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-23 12:20:55,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {4675#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |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 * (4 * ~i~0 - 1), 4); {4700#(and (<= 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-23 12:20:55,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {4700#(and (<= 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; {4700#(and (<= 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-23 12:20:55,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {4700#(and (<= 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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {4700#(and (<= 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-23 12:20:55,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {4700#(and (<= 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; {4710#(and (<= 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-23 12:20:55,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {4710#(and (<= 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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4710#(and (<= 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-23 12:20:55,972 INFO L256 TraceCheckUtils]: 29: Hoare triple {4710#(and (<= 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~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} is VALID [2018-11-23 12:20:55,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} ~cond := #in~cond; {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} is VALID [2018-11-23 12:20:55,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} assume !(0 == ~cond); {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} is VALID [2018-11-23 12:20:55,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} assume true; {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} is VALID [2018-11-23 12:20:55,975 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4717#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4)))} {4710#(and (<= 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))} #90#return; {4710#(and (<= 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-23 12:20:55,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {4710#(and (<= 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~mem8; {4710#(and (<= 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-23 12:20:55,976 INFO L273 TraceCheckUtils]: 35: Hoare triple {4710#(and (<= 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~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {4659#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4739#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:55,984 INFO L256 TraceCheckUtils]: 37: Hoare triple {4739#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {4743#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:55,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {4743#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4747#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:55,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {4747#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4606#false} is VALID [2018-11-23 12:20:55,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {4606#false} assume !false; {4606#false} is VALID [2018-11-23 12:20:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:56,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:56,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-11-23 12:20:56,008 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-11-23 12:20:56,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:56,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:20:56,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:20:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:20:56,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:20:56,109 INFO L87 Difference]: Start difference. First operand 206 states and 276 transitions. Second operand 26 states. [2018-11-23 12:21:02,267 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-23 12:21:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:04,738 INFO L93 Difference]: Finished difference Result 355 states and 454 transitions. [2018-11-23 12:21:04,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:21:04,738 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-11-23 12:21:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:21:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2018-11-23 12:21:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:21:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2018-11-23 12:21:04,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 135 transitions. [2018-11-23 12:21:05,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:05,454 INFO L225 Difference]: With dead ends: 355 [2018-11-23 12:21:05,455 INFO L226 Difference]: Without dead ends: 353 [2018-11-23 12:21:05,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=316, Invalid=1664, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:21:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-11-23 12:21:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 220. [2018-11-23 12:21:06,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:06,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand 220 states. [2018-11-23 12:21:06,361 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand 220 states. [2018-11-23 12:21:06,362 INFO L87 Difference]: Start difference. First operand 353 states. Second operand 220 states. [2018-11-23 12:21:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:06,377 INFO L93 Difference]: Finished difference Result 353 states and 451 transitions. [2018-11-23 12:21:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 451 transitions. [2018-11-23 12:21:06,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:06,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:06,379 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 353 states. [2018-11-23 12:21:06,379 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 353 states. [2018-11-23 12:21:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:06,395 INFO L93 Difference]: Finished difference Result 353 states and 451 transitions. [2018-11-23 12:21:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 451 transitions. [2018-11-23 12:21:06,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:06,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:06,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:06,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-23 12:21:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 295 transitions. [2018-11-23 12:21:06,405 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 295 transitions. Word has length 41 [2018-11-23 12:21:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:06,405 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 295 transitions. [2018-11-23 12:21:06,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:21:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 295 transitions. [2018-11-23 12:21:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:21:06,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:06,407 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:06,407 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:06,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash 708183767, now seen corresponding path program 3 times [2018-11-23 12:21:06,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:07,177 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-11-23 12:21:07,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {6214#true} call ULTIMATE.init(); {6214#true} is VALID [2018-11-23 12:21:07,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {6214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6214#true} is VALID [2018-11-23 12:21:07,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {6214#true} assume true; {6214#true} is VALID [2018-11-23 12:21:07,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6214#true} {6214#true} #86#return; {6214#true} is VALID [2018-11-23 12:21:07,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {6214#true} call #t~ret9 := main(); {6214#true} is VALID [2018-11-23 12:21:07,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {6214#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6214#true} is VALID [2018-11-23 12:21:07,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {6214#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; {6216#(or (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:21:07,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {6216#(or (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,556 INFO L273 TraceCheckUtils]: 13: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,557 INFO L273 TraceCheckUtils]: 14: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:07,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {6217#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {6218#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 4))))))} is VALID [2018-11-23 12:21:07,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {6218#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 4))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6219#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= (* 4 main_~i~0) 8) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= (* 4 main_~i~0) 7)))} is VALID [2018-11-23 12:21:07,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {6219#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= (* 4 main_~i~0) 8) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= (* 4 main_~i~0) 7)))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {6220#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)))} is VALID [2018-11-23 12:21:07,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {6220#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)))} ~i~0 := 0; {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:21:07,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:21:07,563 INFO L256 TraceCheckUtils]: 20: Hoare triple {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6214#true} is VALID [2018-11-23 12:21:07,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {6214#true} ~cond := #in~cond; {6214#true} is VALID [2018-11-23 12:21:07,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {6214#true} assume !(0 == ~cond); {6214#true} is VALID [2018-11-23 12:21:07,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {6214#true} assume true; {6214#true} is VALID [2018-11-23 12:21:07,565 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {6214#true} {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} #90#return; {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:21:07,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} havoc #t~mem8; {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:21:07,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {6221#(and (<= ~SIZE~0 4) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))))) (<= ~SIZE~0 3)) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:21:07,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:21:07,567 INFO L256 TraceCheckUtils]: 28: Hoare triple {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6214#true} is VALID [2018-11-23 12:21:07,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {6214#true} ~cond := #in~cond; {6214#true} is VALID [2018-11-23 12:21:07,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {6214#true} assume !(0 == ~cond); {6214#true} is VALID [2018-11-23 12:21:07,568 INFO L273 TraceCheckUtils]: 31: Hoare triple {6214#true} assume true; {6214#true} is VALID [2018-11-23 12:21:07,569 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {6214#true} {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} #90#return; {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:21:07,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} havoc #t~mem8; {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:21:07,571 INFO L273 TraceCheckUtils]: 34: Hoare triple {6222#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 2))))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:21:07,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:21:07,572 INFO L256 TraceCheckUtils]: 36: Hoare triple {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6214#true} is VALID [2018-11-23 12:21:07,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {6214#true} ~cond := #in~cond; {6214#true} is VALID [2018-11-23 12:21:07,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {6214#true} assume !(0 == ~cond); {6214#true} is VALID [2018-11-23 12:21:07,573 INFO L273 TraceCheckUtils]: 39: Hoare triple {6214#true} assume true; {6214#true} is VALID [2018-11-23 12:21:07,574 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6214#true} {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} #90#return; {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:21:07,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} havoc #t~mem8; {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:21:07,576 INFO L273 TraceCheckUtils]: 42: Hoare triple {6223#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6224#(or (<= ~SIZE~0 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))))} is VALID [2018-11-23 12:21:07,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {6224#(or (<= ~SIZE~0 main_~i~0) (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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6225#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 12:21:07,578 INFO L256 TraceCheckUtils]: 44: Hoare triple {6225#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6226#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:21:07,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {6226#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6227#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:21:07,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {6227#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6215#false} is VALID [2018-11-23 12:21:07,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {6215#false} assume !false; {6215#false} is VALID [2018-11-23 12:21:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:21:07,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:07,588 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-23 12:21:07,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:21:07,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:21:07,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:07,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:07,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 12:21:07,731 INFO L478 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 10 treesize of output 9 [2018-11-23 12:21:07,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:07,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:07,747 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-23 12:21:07,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-23 12:21:07,751 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:07,751 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= (store |v_#memory_int_42| |main_~#a~0.base| (store (select |v_#memory_int_42| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12) main_~value~0)) |#memory_int|) (= main_~DEFAULTVAL~0 0)) [2018-11-23 12:21:07,751 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0)) [2018-11-23 12:21:11,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 12:21:11,134 INFO L478 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 16 treesize of output 4 [2018-11-23 12:21:11,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,142 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-23 12:21:11,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2018-11-23 12:21:11,144 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:11,145 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (and (= |main_#t~mem8| .cse0) (not (= main_~DEFAULTVAL~0 .cse0)) (= main_~DEFAULTVAL~0 0))) [2018-11-23 12:21:11,145 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 0)) [2018-11-23 12:21:11,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {6214#true} call ULTIMATE.init(); {6214#true} is VALID [2018-11-23 12:21:11,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {6214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6214#true} is VALID [2018-11-23 12:21:11,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {6214#true} assume true; {6214#true} is VALID [2018-11-23 12:21:11,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6214#true} {6214#true} #86#return; {6214#true} is VALID [2018-11-23 12:21:11,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {6214#true} call #t~ret9 := main(); {6214#true} is VALID [2018-11-23 12:21:11,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {6214#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6214#true} is VALID [2018-11-23 12:21:11,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {6214#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; {6249#(= main_~DEFAULTVAL~0 0)} is VALID [2018-11-23 12:21:11,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {6249#(= main_~DEFAULTVAL~0 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {6253#(and (= main_~i~0 1) (= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {6278#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {6278#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6278#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {6278#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {6278#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {6278#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,219 INFO L256 TraceCheckUtils]: 20: Hoare triple {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} ~cond := #in~cond; {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} assume !(0 == ~cond); {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} assume true; {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,222 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} #90#return; {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {6288#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,226 INFO L256 TraceCheckUtils]: 28: Hoare triple {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} ~cond := #in~cond; {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} assume !(0 == ~cond); {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,228 INFO L273 TraceCheckUtils]: 31: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} assume true; {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,230 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} #90#return; {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,231 INFO L273 TraceCheckUtils]: 34: Hoare triple {6314#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,233 INFO L256 TraceCheckUtils]: 36: Hoare triple {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} ~cond := #in~cond; {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} assume !(0 == ~cond); {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} assume true; {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} is VALID [2018-11-23 12:21:11,236 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6295#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 12)) 0)))} {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} #90#return; {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {6339#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6364#(and (= main_~i~0 3) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {6364#(and (= main_~i~0 3) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6368#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:11,240 INFO L256 TraceCheckUtils]: 44: Hoare triple {6368#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {6372#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:11,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {6372#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6376#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:11,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {6376#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6215#false} is VALID [2018-11-23 12:21:11,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {6215#false} assume !false; {6215#false} is VALID [2018-11-23 12:21:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:21:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:11,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 12:21:11,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-11-23 12:21:11,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:11,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:21:11,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:11,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:21:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:21:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:21:11,356 INFO L87 Difference]: Start difference. First operand 220 states and 295 transitions. Second operand 25 states. [2018-11-23 12:22:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:41,985 INFO L93 Difference]: Finished difference Result 559 states and 755 transitions. [2018-11-23 12:22:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:22:41,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-11-23 12:22:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:22:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 160 transitions. [2018-11-23 12:22:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:22:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 160 transitions. [2018-11-23 12:22:41,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 160 transitions. [2018-11-23 12:22:42,361 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-23 12:22:42,386 INFO L225 Difference]: With dead ends: 559 [2018-11-23 12:22:42,387 INFO L226 Difference]: Without dead ends: 523 [2018-11-23 12:22:42,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=369, Invalid=2079, Unknown=2, NotChecked=0, Total=2450 [2018-11-23 12:22:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-23 12:22:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 488. [2018-11-23 12:22:44,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:44,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand 488 states. [2018-11-23 12:22:44,327 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand 488 states. [2018-11-23 12:22:44,327 INFO L87 Difference]: Start difference. First operand 523 states. Second operand 488 states. [2018-11-23 12:22:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:44,349 INFO L93 Difference]: Finished difference Result 523 states and 706 transitions. [2018-11-23 12:22:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 706 transitions. [2018-11-23 12:22:44,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:44,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:44,352 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand 523 states. [2018-11-23 12:22:44,352 INFO L87 Difference]: Start difference. First operand 488 states. Second operand 523 states. [2018-11-23 12:22:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:44,374 INFO L93 Difference]: Finished difference Result 523 states and 706 transitions. [2018-11-23 12:22:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 706 transitions. [2018-11-23 12:22:44,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:44,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:44,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:44,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-23 12:22:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 671 transitions. [2018-11-23 12:22:44,396 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 671 transitions. Word has length 48 [2018-11-23 12:22:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:44,397 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 671 transitions. [2018-11-23 12:22:44,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:22:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 671 transitions. [2018-11-23 12:22:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:22:44,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:44,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:44,399 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:44,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash 635797209, now seen corresponding path program 1 times [2018-11-23 12:22:44,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:44,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:44,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:44,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:44,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:44,926 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 12:22:45,389 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2018-11-23 12:22:46,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {8763#true} call ULTIMATE.init(); {8763#true} is VALID [2018-11-23 12:22:46,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {8763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {8763#true} is VALID [2018-11-23 12:22:46,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {8763#true} assume true; {8763#true} is VALID [2018-11-23 12:22:46,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8763#true} {8763#true} #86#return; {8763#true} is VALID [2018-11-23 12:22:46,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {8763#true} call #t~ret9 := main(); {8763#true} is VALID [2018-11-23 12:22:46,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {8763#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {8763#true} is VALID [2018-11-23 12:22:46,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {8763#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; {8765#(and (or (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {8765#(and (or (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0)) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= 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 * (4 * ~i~0 - 4), 4); {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= 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; {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {8766#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= 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 * (4 * ~i~0 - 3), 4); {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {8767#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (or (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|))) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12))))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {8768#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)))) (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {8768#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 16 main_~i~0) (- 12)))) (not (= (+ ~SIZE~0 12) (+ (* 16 main_~i~0) |main_~#a~0.offset|)))) (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8769#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= |main_~#a~0.offset| 0) (or (and (<= (* 4 main_~i~0) 8) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (+ ~SIZE~0 8))))) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 27)) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))))} is VALID [2018-11-23 12:22:46,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {8769#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= |main_~#a~0.offset| 0) (or (and (<= (* 4 main_~i~0) 8) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (+ ~SIZE~0 8))))) (<= (+ (* 16 main_~i~0) |main_~#a~0.offset|) (+ ~SIZE~0 27)) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {8770#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {8770#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,354 INFO L256 TraceCheckUtils]: 20: Hoare triple {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8763#true} is VALID [2018-11-23 12:22:46,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {8763#true} ~cond := #in~cond; {8763#true} is VALID [2018-11-23 12:22:46,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {8763#true} assume !(0 == ~cond); {8763#true} is VALID [2018-11-23 12:22:46,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {8763#true} assume true; {8763#true} is VALID [2018-11-23 12:22:46,356 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {8763#true} {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #90#return; {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {8771#(and (or (and (<= ~SIZE~0 4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) 4))) (<= ~SIZE~0 (+ |main_~#a~0.offset| 3))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8772#(and (or (and (<= ~SIZE~0 (+ main_~i~0 3)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (<= ~SIZE~0 (+ main_~i~0 |main_~#a~0.offset| 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {8772#(and (or (and (<= ~SIZE~0 (+ main_~i~0 3)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (<= ~SIZE~0 (+ main_~i~0 |main_~#a~0.offset| 2))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8773#(and (or (and (<= ~SIZE~0 (+ main_~i~0 3)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 |main_~#a~0.offset| 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,360 INFO L256 TraceCheckUtils]: 28: Hoare triple {8773#(and (or (and (<= ~SIZE~0 (+ main_~i~0 3)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 |main_~#a~0.offset| 2))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8763#true} is VALID [2018-11-23 12:22:46,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {8763#true} ~cond := #in~cond; {8774#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:22:46,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {8774#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {8775#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:46,362 INFO L273 TraceCheckUtils]: 31: Hoare triple {8775#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8775#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:46,364 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {8775#(not (= |__VERIFIER_assert_#in~cond| 0))} {8773#(and (or (and (<= ~SIZE~0 (+ main_~i~0 3)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))))) (<= ~SIZE~0 (+ main_~i~0 |main_~#a~0.offset| 2))) (= |main_~#a~0.offset| 0))} #90#return; {8776#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {8776#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {8776#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {8776#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,368 INFO L256 TraceCheckUtils]: 36: Hoare triple {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8763#true} is VALID [2018-11-23 12:22:46,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {8763#true} ~cond := #in~cond; {8763#true} is VALID [2018-11-23 12:22:46,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {8763#true} assume !(0 == ~cond); {8763#true} is VALID [2018-11-23 12:22:46,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {8763#true} assume true; {8763#true} is VALID [2018-11-23 12:22:46,369 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {8763#true} {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} #90#return; {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} havoc #t~mem8; {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,371 INFO L273 TraceCheckUtils]: 42: Hoare triple {8777#(and (or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 5))) (= |main_~#a~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8778#(and (or (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 2)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:46,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {8778#(and (or (<= (+ (* 3 ~SIZE~0) |main_~#a~0.offset|) (+ (* 3 main_~i~0) 2)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~DEFAULTVAL~0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8779#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:22:46,374 INFO L256 TraceCheckUtils]: 44: Hoare triple {8779#(not (= |main_#t~mem8| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8775#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:46,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {8775#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8780#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:46,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {8780#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8764#false} is VALID [2018-11-23 12:22:46,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {8764#false} assume !false; {8764#false} is VALID [2018-11-23 12:22:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:22:46,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:46,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:46,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:46,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:46,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 12:22:46,614 INFO L478 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 10 treesize of output 9 [2018-11-23 12:22:46,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,630 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-23 12:22:46,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-23 12:22:46,635 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:46,635 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, main_~FIXEDVAL~0]. (and (= (store |v_#memory_int_43| |main_~#a~0.base| (store (select |v_#memory_int_43| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12) main_~FIXEDVAL~0)) |#memory_int|) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:22:46,635 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:22:47,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:22:47,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-11-23 12:22:47,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,128 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-23 12:22:47,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:22:47,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:47,131 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 12))) (and (<= .cse0 |main_#t~mem8|) (<= 10 .cse0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:22:47,131 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:22:47,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {8763#true} call ULTIMATE.init(); {8763#true} is VALID [2018-11-23 12:22:47,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {8763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {8763#true} is VALID [2018-11-23 12:22:47,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {8763#true} assume true; {8763#true} is VALID [2018-11-23 12:22:47,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8763#true} {8763#true} #86#return; {8763#true} is VALID [2018-11-23 12:22:47,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {8763#true} call #t~ret9 := main(); {8763#true} is VALID [2018-11-23 12:22:47,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {8763#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {8763#true} is VALID [2018-11-23 12:22:47,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {8763#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; {8802#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {8802#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {8806#(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 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {8806#(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 * (4 * ~i~0 - 4), 4); {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {8806#(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; {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {8806#(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 * (4 * ~i~0 - 3), 4); {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {8806#(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; {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {8806#(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 * (4 * ~i~0 - 2), 4); {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {8806#(and (= 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; {8806#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {8806#(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 * (4 * ~i~0 - 1), 4); {8831#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {8831#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8831#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {8831#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {8831#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {8831#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,255 INFO L256 TraceCheckUtils]: 20: Hoare triple {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} ~cond := #in~cond; {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} assume !(0 == ~cond); {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} assume true; {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,258 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #90#return; {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,260 INFO L273 TraceCheckUtils]: 26: Hoare triple {8841#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,262 INFO L256 TraceCheckUtils]: 28: Hoare triple {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} ~cond := #in~cond; {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} assume !(0 == ~cond); {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} assume true; {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,265 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #90#return; {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,266 INFO L273 TraceCheckUtils]: 34: Hoare triple {8867#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,267 INFO L273 TraceCheckUtils]: 35: Hoare triple {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,269 INFO L256 TraceCheckUtils]: 36: Hoare triple {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,269 INFO L273 TraceCheckUtils]: 37: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} ~cond := #in~cond; {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} assume !(0 == ~cond); {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} assume true; {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} is VALID [2018-11-23 12:22:47,271 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {8848#(exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))} {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #90#return; {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem8; {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {8892#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 2) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8917#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 3) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {8917#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= main_~i~0 3) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8921#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:22:47,275 INFO L256 TraceCheckUtils]: 44: Hoare triple {8921#(and (<= 10 |main_#t~mem8|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {8925#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:47,276 INFO L273 TraceCheckUtils]: 45: Hoare triple {8925#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {8929#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:47,276 INFO L273 TraceCheckUtils]: 46: Hoare triple {8929#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8764#false} is VALID [2018-11-23 12:22:47,277 INFO L273 TraceCheckUtils]: 47: Hoare triple {8764#false} assume !false; {8764#false} is VALID [2018-11-23 12:22:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:22:47,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:47,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-11-23 12:22:47,306 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-11-23 12:22:47,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:47,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:22:47,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:47,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:22:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:22:47,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:22:47,418 INFO L87 Difference]: Start difference. First operand 488 states and 671 transitions. Second operand 29 states. [2018-11-23 12:22:52,455 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2018-11-23 12:22:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:58,958 INFO L93 Difference]: Finished difference Result 799 states and 1082 transitions. [2018-11-23 12:22:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:22:58,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-11-23 12:22:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:22:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 175 transitions. [2018-11-23 12:22:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:22:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 175 transitions. [2018-11-23 12:22:58,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 175 transitions. [2018-11-23 12:23:00,078 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-23 12:23:00,119 INFO L225 Difference]: With dead ends: 799 [2018-11-23 12:23:00,120 INFO L226 Difference]: Without dead ends: 761 [2018-11-23 12:23:00,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=505, Invalid=3277, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:23:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-23 12:23:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 536. [2018-11-23 12:23:03,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:03,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 761 states. Second operand 536 states. [2018-11-23 12:23:03,022 INFO L74 IsIncluded]: Start isIncluded. First operand 761 states. Second operand 536 states. [2018-11-23 12:23:03,022 INFO L87 Difference]: Start difference. First operand 761 states. Second operand 536 states. [2018-11-23 12:23:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:03,059 INFO L93 Difference]: Finished difference Result 761 states and 1037 transitions. [2018-11-23 12:23:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1037 transitions. [2018-11-23 12:23:03,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:03,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:03,062 INFO L74 IsIncluded]: Start isIncluded. First operand 536 states. Second operand 761 states. [2018-11-23 12:23:03,062 INFO L87 Difference]: Start difference. First operand 536 states. Second operand 761 states. [2018-11-23 12:23:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:03,102 INFO L93 Difference]: Finished difference Result 761 states and 1037 transitions. [2018-11-23 12:23:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1037 transitions. [2018-11-23 12:23:03,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:03,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:03,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:03,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-23 12:23:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 744 transitions. [2018-11-23 12:23:03,128 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 744 transitions. Word has length 48 [2018-11-23 12:23:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:03,128 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 744 transitions. [2018-11-23 12:23:03,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:23:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 744 transitions. [2018-11-23 12:23:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:23:03,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:03,130 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:03,131 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:03,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash 145149962, now seen corresponding path program 1 times [2018-11-23 12:23:03,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:03,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:03,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:03,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:03,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:03,867 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-11-23 12:23:03,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {12144#true} call ULTIMATE.init(); {12144#true} is VALID [2018-11-23 12:23:03,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {12144#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {12144#true} is VALID [2018-11-23 12:23:03,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {12144#true} assume true; {12144#true} is VALID [2018-11-23 12:23:03,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12144#true} {12144#true} #86#return; {12144#true} is VALID [2018-11-23 12:23:03,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {12144#true} call #t~ret9 := main(); {12144#true} is VALID [2018-11-23 12:23:03,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {12144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {12144#true} is VALID [2018-11-23 12:23:03,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {12144#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; {12146#(or (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:23:03,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {12146#(or (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:03,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {12147#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12148#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:03,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {12148#(and (= ~SIZE~0 (* 4 (div ~SIZE~0 4))) (<= main_~i~0 2))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {12149#(<= ~SIZE~0 4)} is VALID [2018-11-23 12:23:03,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {12149#(<= ~SIZE~0 4)} ~i~0 := 0; {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:03,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:03,991 INFO L256 TraceCheckUtils]: 20: Hoare triple {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12144#true} is VALID [2018-11-23 12:23:03,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {12144#true} ~cond := #in~cond; {12144#true} is VALID [2018-11-23 12:23:03,991 INFO L273 TraceCheckUtils]: 22: Hoare triple {12144#true} assume !(0 == ~cond); {12144#true} is VALID [2018-11-23 12:23:03,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {12144#true} assume true; {12144#true} is VALID [2018-11-23 12:23:03,992 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {12144#true} {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} #90#return; {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:03,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} havoc #t~mem8; {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:03,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {12150#(and (<= ~SIZE~0 4) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12151#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-23 12:23:03,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {12151#(<= ~SIZE~0 (+ main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12151#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-23 12:23:03,994 INFO L256 TraceCheckUtils]: 28: Hoare triple {12151#(<= ~SIZE~0 (+ main_~i~0 3))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12144#true} is VALID [2018-11-23 12:23:03,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {12144#true} ~cond := #in~cond; {12144#true} is VALID [2018-11-23 12:23:03,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {12144#true} assume !(0 == ~cond); {12144#true} is VALID [2018-11-23 12:23:03,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {12144#true} assume true; {12144#true} is VALID [2018-11-23 12:23:03,995 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {12144#true} {12151#(<= ~SIZE~0 (+ main_~i~0 3))} #90#return; {12151#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-23 12:23:04,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {12151#(<= ~SIZE~0 (+ main_~i~0 3))} havoc #t~mem8; {12151#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-23 12:23:04,017 INFO L273 TraceCheckUtils]: 34: Hoare triple {12151#(<= ~SIZE~0 (+ main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12152#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-23 12:23:04,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {12152#(<= ~SIZE~0 (+ main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12152#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-23 12:23:04,018 INFO L256 TraceCheckUtils]: 36: Hoare triple {12152#(<= ~SIZE~0 (+ main_~i~0 2))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12144#true} is VALID [2018-11-23 12:23:04,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {12144#true} ~cond := #in~cond; {12144#true} is VALID [2018-11-23 12:23:04,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {12144#true} assume !(0 == ~cond); {12144#true} is VALID [2018-11-23 12:23:04,018 INFO L273 TraceCheckUtils]: 39: Hoare triple {12144#true} assume true; {12144#true} is VALID [2018-11-23 12:23:04,019 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {12144#true} {12152#(<= ~SIZE~0 (+ main_~i~0 2))} #90#return; {12152#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-23 12:23:04,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {12152#(<= ~SIZE~0 (+ main_~i~0 2))} havoc #t~mem8; {12152#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-23 12:23:04,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {12152#(<= ~SIZE~0 (+ main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12153#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:23:04,020 INFO L273 TraceCheckUtils]: 43: Hoare triple {12153#(<= ~SIZE~0 (+ main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12153#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:23:04,020 INFO L256 TraceCheckUtils]: 44: Hoare triple {12153#(<= ~SIZE~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12144#true} is VALID [2018-11-23 12:23:04,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {12144#true} ~cond := #in~cond; {12144#true} is VALID [2018-11-23 12:23:04,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {12144#true} assume !(0 == ~cond); {12144#true} is VALID [2018-11-23 12:23:04,020 INFO L273 TraceCheckUtils]: 47: Hoare triple {12144#true} assume true; {12144#true} is VALID [2018-11-23 12:23:04,021 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {12144#true} {12153#(<= ~SIZE~0 (+ main_~i~0 1))} #90#return; {12153#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:23:04,021 INFO L273 TraceCheckUtils]: 49: Hoare triple {12153#(<= ~SIZE~0 (+ main_~i~0 1))} havoc #t~mem8; {12153#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:23:04,022 INFO L273 TraceCheckUtils]: 50: Hoare triple {12153#(<= ~SIZE~0 (+ main_~i~0 1))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12154#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-23 12:23:04,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {12154#(<= ~SIZE~0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12145#false} is VALID [2018-11-23 12:23:04,023 INFO L256 TraceCheckUtils]: 52: Hoare triple {12145#false} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12145#false} is VALID [2018-11-23 12:23:04,023 INFO L273 TraceCheckUtils]: 53: Hoare triple {12145#false} ~cond := #in~cond; {12145#false} is VALID [2018-11-23 12:23:04,023 INFO L273 TraceCheckUtils]: 54: Hoare triple {12145#false} assume 0 == ~cond; {12145#false} is VALID [2018-11-23 12:23:04,024 INFO L273 TraceCheckUtils]: 55: Hoare triple {12145#false} assume !false; {12145#false} is VALID [2018-11-23 12:23:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:23:04,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:04,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:04,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:04,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {12144#true} call ULTIMATE.init(); {12144#true} is VALID [2018-11-23 12:23:04,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {12144#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {12144#true} is VALID [2018-11-23 12:23:04,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {12144#true} assume true; {12144#true} is VALID [2018-11-23 12:23:04,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12144#true} {12144#true} #86#return; {12144#true} is VALID [2018-11-23 12:23:04,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {12144#true} call #t~ret9 := main(); {12144#true} is VALID [2018-11-23 12:23:04,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {12144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {12144#true} is VALID [2018-11-23 12:23:04,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {12144#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; {12176#(< 1 ~SIZE~0)} is VALID [2018-11-23 12:23:04,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {12176#(< 1 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:04,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {12180#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12208#(and (= (mod ~SIZE~0 4) 0) (<= main_~i~0 2) (< 1 ~SIZE~0))} is VALID [2018-11-23 12:23:04,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {12208#(and (= (mod ~SIZE~0 4) 0) (<= main_~i~0 2) (< 1 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} ~i~0 := 0; {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,507 INFO L256 TraceCheckUtils]: 20: Hoare triple {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} ~cond := #in~cond; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !(0 == ~cond); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume true; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,510 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} #90#return; {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} havoc #t~mem8; {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {12216#(and (<= 0 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,514 INFO L256 TraceCheckUtils]: 28: Hoare triple {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} ~cond := #in~cond; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !(0 == ~cond); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume true; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,517 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} #90#return; {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} havoc #t~mem8; {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {12241#(and (<= 1 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,520 INFO L256 TraceCheckUtils]: 36: Hoare triple {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} ~cond := #in~cond; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,522 INFO L273 TraceCheckUtils]: 38: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !(0 == ~cond); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,522 INFO L273 TraceCheckUtils]: 39: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume true; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,523 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} #90#return; {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} havoc #t~mem8; {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {12266#(and (<= 2 main_~i~0) (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} is VALID [2018-11-23 12:23:04,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} is VALID [2018-11-23 12:23:04,526 INFO L256 TraceCheckUtils]: 44: Hoare triple {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} ~cond := #in~cond; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,528 INFO L273 TraceCheckUtils]: 46: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !(0 == ~cond); {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,528 INFO L273 TraceCheckUtils]: 47: Hoare triple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume true; {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,529 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {12212#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} #90#return; {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} is VALID [2018-11-23 12:23:04,530 INFO L273 TraceCheckUtils]: 49: Hoare triple {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} havoc #t~mem8; {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} is VALID [2018-11-23 12:23:04,531 INFO L273 TraceCheckUtils]: 50: Hoare triple {12291#(and (= (mod ~SIZE~0 4) 0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1) (<= 3 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12316#(and (= (mod ~SIZE~0 4) 0) (<= 4 main_~i~0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} is VALID [2018-11-23 12:23:04,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {12316#(and (= (mod ~SIZE~0 4) 0) (<= 4 main_~i~0) (< 1 ~SIZE~0) (<= (div ~SIZE~0 4) 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12145#false} is VALID [2018-11-23 12:23:04,532 INFO L256 TraceCheckUtils]: 52: Hoare triple {12145#false} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {12145#false} is VALID [2018-11-23 12:23:04,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {12145#false} ~cond := #in~cond; {12145#false} is VALID [2018-11-23 12:23:04,533 INFO L273 TraceCheckUtils]: 54: Hoare triple {12145#false} assume 0 == ~cond; {12145#false} is VALID [2018-11-23 12:23:04,533 INFO L273 TraceCheckUtils]: 55: Hoare triple {12145#false} assume !false; {12145#false} is VALID [2018-11-23 12:23:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:23:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 12:23:04,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-11-23 12:23:04,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:04,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:23:04,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:04,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:23:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:23:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:23:04,650 INFO L87 Difference]: Start difference. First operand 536 states and 744 transitions. Second operand 20 states. [2018-11-23 12:23:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:08,076 INFO L93 Difference]: Finished difference Result 581 states and 787 transitions. [2018-11-23 12:23:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:23:08,076 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-11-23 12:23:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:23:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 12:23:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:23:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 12:23:08,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2018-11-23 12:23:08,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:08,935 INFO L225 Difference]: With dead ends: 581 [2018-11-23 12:23:08,935 INFO L226 Difference]: Without dead ends: 530 [2018-11-23 12:23:08,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:23:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-11-23 12:23:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 429. [2018-11-23 12:23:11,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:11,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states. Second operand 429 states. [2018-11-23 12:23:11,425 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states. Second operand 429 states. [2018-11-23 12:23:11,425 INFO L87 Difference]: Start difference. First operand 530 states. Second operand 429 states. [2018-11-23 12:23:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:11,449 INFO L93 Difference]: Finished difference Result 530 states and 734 transitions. [2018-11-23 12:23:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 734 transitions. [2018-11-23 12:23:11,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:11,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:11,451 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 530 states. [2018-11-23 12:23:11,451 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 530 states. [2018-11-23 12:23:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:11,472 INFO L93 Difference]: Finished difference Result 530 states and 734 transitions. [2018-11-23 12:23:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 734 transitions. [2018-11-23 12:23:11,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:11,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:11,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:11,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-23 12:23:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 587 transitions. [2018-11-23 12:23:11,491 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 587 transitions. Word has length 56 [2018-11-23 12:23:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:11,491 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 587 transitions. [2018-11-23 12:23:11,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:23:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 587 transitions. [2018-11-23 12:23:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:23:11,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:11,493 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:11,493 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:11,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash 868865190, now seen corresponding path program 1 times [2018-11-23 12:23:11,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:11,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:11,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:12,136 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-23 12:23:12,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {14624#true} call ULTIMATE.init(); {14624#true} is VALID [2018-11-23 12:23:12,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {14624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {14624#true} is VALID [2018-11-23 12:23:12,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {14624#true} assume true; {14624#true} is VALID [2018-11-23 12:23:12,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14624#true} {14624#true} #86#return; {14624#true} is VALID [2018-11-23 12:23:12,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {14624#true} call #t~ret9 := main(); {14624#true} is VALID [2018-11-23 12:23:12,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {14624#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {14624#true} is VALID [2018-11-23 12:23:12,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {14624#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; {14624#true} is VALID [2018-11-23 12:23:12,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {14624#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then ~SIZE~0 % 4 - 4 else ~SIZE~0 % 4) then 1 else 0);~i~0 := 1; {14626#(= main_~i~0 1)} is VALID [2018-11-23 12:23:12,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {14626#(= main_~i~0 1)} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {14626#(= main_~i~0 1)} is VALID [2018-11-23 12:23:12,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {14626#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {14626#(= main_~i~0 1)} is VALID [2018-11-23 12:23:12,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {14626#(= main_~i~0 1)} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {14626#(= main_~i~0 1)} is VALID [2018-11-23 12:23:12,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {14626#(= main_~i~0 1)} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {14626#(= main_~i~0 1)} is VALID [2018-11-23 12:23:12,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {14626#(= main_~i~0 1)} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {14626#(= main_~i~0 1)} is VALID [2018-11-23 12:23:12,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {14626#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {14627#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:12,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {14627#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {14627#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:12,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {14627#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {14627#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1))} is VALID [2018-11-23 12:23:12,972 INFO L273 TraceCheckUtils]: 16: Hoare triple {14627#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))))) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {14628#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))) 8)) 16) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 4), 4); {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} is VALID [2018-11-23 12:23:12,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {14629#(and (not (= (* 16 main_~i~0) 16)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 3), 4); {14630#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {14630#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {14630#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {14630#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 2), 4); {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} call #t~ret6 := ReadFromPort();assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~value~0 := #t~ret6;havoc #t~ret6; {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (4 * ~i~0 - 1), 4); {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 4 then 1 + ~SIZE~0 / 4 else ~SIZE~0 / 4)); {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} is VALID [2018-11-23 12:23:12,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {14631#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8))))))} ~i~0 := 0; {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:12,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:12,992 INFO L256 TraceCheckUtils]: 38: Hoare triple {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {14624#true} is VALID [2018-11-23 12:23:12,992 INFO L273 TraceCheckUtils]: 39: Hoare triple {14624#true} ~cond := #in~cond; {14624#true} is VALID [2018-11-23 12:23:12,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {14624#true} assume !(0 == ~cond); {14624#true} is VALID [2018-11-23 12:23:12,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {14624#true} assume true; {14624#true} is VALID [2018-11-23 12:23:13,010 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {14624#true} {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} #90#return; {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:13,023 INFO L273 TraceCheckUtils]: 43: Hoare triple {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} havoc #t~mem8; {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:13,038 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 4) (- 8)))))) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} is VALID [2018-11-23 12:23:13,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} is VALID [2018-11-23 12:23:13,047 INFO L256 TraceCheckUtils]: 46: Hoare triple {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {14624#true} is VALID [2018-11-23 12:23:13,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {14624#true} ~cond := #in~cond; {14624#true} is VALID [2018-11-23 12:23:13,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {14624#true} assume !(0 == ~cond); {14624#true} is VALID [2018-11-23 12:23:13,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {14624#true} assume true; {14624#true} is VALID [2018-11-23 12:23:13,061 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {14624#true} {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} #90#return; {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} is VALID [2018-11-23 12:23:13,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} havoc #t~mem8; {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} is VALID [2018-11-23 12:23:13,082 INFO L273 TraceCheckUtils]: 52: Hoare triple {14633#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 3)) (- 8))))))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14634#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:23:13,098 INFO L273 TraceCheckUtils]: 53: Hoare triple {14634#(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~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 12:23:13,100 INFO L256 TraceCheckUtils]: 54: Hoare triple {14635#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1 else 0)); {14636#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:23:13,101 INFO L273 TraceCheckUtils]: 55: Hoare triple {14636#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {14637#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:23:13,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {14637#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14625#false} is VALID [2018-11-23 12:23:13,105 INFO L273 TraceCheckUtils]: 57: Hoare triple {14625#false} assume !false; {14625#false} is VALID [2018-11-23 12:23:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:23:13,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:13,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:13,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:13,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:13,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:23:13,243 INFO L478 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-23 12:23:13,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,256 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-23 12:23:13,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 12:23:13,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:13,260 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_44|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= main_~i~0 1) (= (store |v_#memory_int_44| |main_~#a~0.base| (store (select |v_#memory_int_44| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0)) [2018-11-23 12:23:13,260 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:23:13,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 12:23:13,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,305 INFO L478 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-23 12:23:13,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,325 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-23 12:23:13,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-23 12:23:13,330 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:13,330 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_45| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (not (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |#memory_int| (store |v_#memory_int_45| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 4)) main_~value~0))) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,330 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:23:13,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:23:13,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,383 INFO L478 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 22 treesize of output 34 [2018-11-23 12:23:13,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,408 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-23 12:23:13,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-23 12:23:13,412 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:13,412 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_46| |main_~#a~0.base|))) (and (= |#memory_int| (store |v_#memory_int_46| |main_~#a~0.base| (store .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0))) (<= 2 main_~i~0) (not (= (select .cse0 (+ |main_~#a~0.offset| 8)) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,412 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:23:13,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:23:13,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,439 INFO L478 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 22 treesize of output 34 [2018-11-23 12:23:13,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 12:23:13,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 12:23:13,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,532 INFO L478 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 32 treesize of output 71 [2018-11-23 12:23:13,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,562 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-23 12:23:13,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2018-11-23 12:23:13,567 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:13,568 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_48| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= (store |v_#memory_int_48| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)) main_~value~0)) |#memory_int|) (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,568 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (= main_~FIXEDVAL~0 (select .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 12:23:13,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,604 INFO L478 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 32 treesize of output 71 [2018-11-23 12:23:13,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,655 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-23 12:23:13,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2018-11-23 12:23:13,662 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:13,662 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_49| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (and (<= 2 main_~i~0) (= |#memory_int| (store |v_#memory_int_49| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 4)) main_~value~0))) (not (= (select .cse0 (+ |main_~#a~0.offset| 8)) main_~DEFAULTVAL~0)) (= main_~FIXEDVAL~0 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12)))) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,662 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (= main_~FIXEDVAL~0 (select .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 12)))) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 12:23:13,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,756 INFO L478 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 32 treesize of output 71 [2018-11-23 12:23:13,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:23:13,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-11-23 12:23:13,799 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:13,799 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, main_~value~0, v_main_~i~0_39]. (let ((.cse0 (select |v_#memory_int_50| |main_~#a~0.base|))) (and (= (store |v_#memory_int_50| |main_~#a~0.base| (store .cse0 (+ (* 16 main_~i~0) |main_~#a~0.offset| (- 16)) main_~value~0)) |#memory_int|) (= main_~FIXEDVAL~0 (select .cse0 (+ (* 16 v_main_~i~0_39) |main_~#a~0.offset| (- 12)))) (<= 2 v_main_~i~0_39) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (<= (+ v_main_~i~0_39 1) main_~i~0) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,800 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_39]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= main_~FIXEDVAL~0 (select .cse0 (+ (* 16 v_main_~i~0_39) |main_~#a~0.offset| (- 12)))) (<= 2 v_main_~i~0_39) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (<= (+ v_main_~i~0_39 1) main_~i~0) (= |main_~#a~0.offset| 0))) [2018-11-23 12:23:13,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 12:23:13,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:13,944 INFO L478 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 32 treesize of output 71 [2018-11-23 12:23:13,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:13,975 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-23 12:23:13,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-11-23 12:23:14,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2018-11-23 12:23:14,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,076 INFO L478 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 46 treesize of output 128 [2018-11-23 12:23:14,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:14,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:14,124 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-23 12:23:14,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-11-23 12:23:14,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-11-23 12:23:14,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:14,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 193 [2018-11-23 12:23:14,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:14,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:14,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:23:14,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:64 [2018-11-23 12:23:14,323 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:14,323 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, main_~i~0, main_~value~0, v_main_~i~0_39]. (let ((.cse1 (select |v_#memory_int_53| |main_~#a~0.base|)) (.cse2 (* 16 main_~i~0))) (let ((.cse0 (select .cse1 (+ .cse2 |main_~#a~0.offset| (- 12))))) (and (= .cse0 (select .cse1 (+ (* 16 v_main_~i~0_39) |main_~#a~0.offset| (- 12)))) (= (select .cse1 (+ .cse2 |main_~#a~0.offset| (- 8))) .cse0) (= (store |v_#memory_int_53| |main_~#a~0.base| (store .cse1 (+ .cse2 |main_~#a~0.offset| (- 4)) main_~value~0)) |#memory_int|) (<= 2 v_main_~i~0_39) (<= (+ v_main_~i~0_39 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse1 (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:23:14,324 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_main_~i~0_39]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse1 (* 16 main_~i~0))) (let ((.cse2 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12))))) (and (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 8))) .cse2) (= .cse2 (select .cse0 (+ (* 16 v_main_~i~0_39) |main_~#a~0.offset| (- 12)))) (<= 2 v_main_~i~0_39) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (<= (+ v_main_~i~0_39 1) main_~i~0) (= |main_~#a~0.offset| 0))))