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/tcpy_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:23:27,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:27,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:27,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:27,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:27,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:27,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:27,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:27,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:27,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:27,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:27,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:27,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:27,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:27,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:27,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:27,883 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:27,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:27,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:27,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:27,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:27,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:27,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:27,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:27,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:27,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:27,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:27,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:27,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:27,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:27,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:27,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:27,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:27,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:27,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:27,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:27,917 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:23:27,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:27,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:27,946 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:27,946 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:27,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:23:27,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:23:27,947 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:23:27,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:27,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:27,949 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:27,949 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:27,949 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:27,949 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:27,950 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:27,950 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:27,950 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:27,950 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:27,950 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:27,952 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:27,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:27,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:27,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:27,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:27,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:27,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:27,954 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:27,954 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:27,954 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:23:27,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:27,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:27,955 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:28,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:28,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:28,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:28,043 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:28,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:28,044 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy_true-unreach-call.i [2018-11-23 12:23:28,110 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23711438/600605087bad4ad5ba334ade0cbf3d9e/FLAG1f0f38502 [2018-11-23 12:23:28,618 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:28,619 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy_true-unreach-call.i [2018-11-23 12:23:28,628 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23711438/600605087bad4ad5ba334ade0cbf3d9e/FLAG1f0f38502 [2018-11-23 12:23:28,938 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23711438/600605087bad4ad5ba334ade0cbf3d9e [2018-11-23 12:23:28,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:28,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:28,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:28,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:28,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:28,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:28" (1/1) ... [2018-11-23 12:23:28,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7785a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:28, skipping insertion in model container [2018-11-23 12:23:28,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:28" (1/1) ... [2018-11-23 12:23:28,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:28,998 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:29,217 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:29,222 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:29,250 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:29,273 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:29,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29 WrapperNode [2018-11-23 12:23:29,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:29,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:29,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:29,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:29,281 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:23:29" (1/1) ... [2018-11-23 12:23:29,289 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:23:29" (1/1) ... [2018-11-23 12:23:29,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:29,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:29,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:29,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:29,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:29,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:29,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:29,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:29,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (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:23:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:23:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:23:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:23:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:23:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:23:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:23:30,058 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:30,058 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:23:30,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:30 BoogieIcfgContainer [2018-11-23 12:23:30,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:30,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:30,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:30,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:30,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:28" (1/3) ... [2018-11-23 12:23:30,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3037b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:30, skipping insertion in model container [2018-11-23 12:23:30,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (2/3) ... [2018-11-23 12:23:30,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3037b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:30, skipping insertion in model container [2018-11-23 12:23:30,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:30" (3/3) ... [2018-11-23 12:23:30,067 INFO L112 eAbstractionObserver]: Analyzing ICFG tcpy_true-unreach-call.i [2018-11-23 12:23:30,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:30,084 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:30,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:30,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:23:30,137 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:30,138 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:30,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:30,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:30,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:30,138 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:30,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:30,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 12:23:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:23:30,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:30,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:30,167 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:30,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash -93115520, now seen corresponding path program 1 times [2018-11-23 12:23:30,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:30,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:30,757 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-23 12:23:30,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 12:23:30,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {30#true} is VALID [2018-11-23 12:23:30,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 12:23:30,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #60#return; {30#true} is VALID [2018-11-23 12:23:30,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret8 := main(); {30#true} is VALID [2018-11-23 12:23:30,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {30#true} is VALID [2018-11-23 12:23:30,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {32#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:23:30,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {33#(and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:30,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#(and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {31#false} is VALID [2018-11-23 12:23:30,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0; {31#false} is VALID [2018-11-23 12:23:30,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31#false} is VALID [2018-11-23 12:23:30,823 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {31#false} is VALID [2018-11-23 12:23:30,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 12:23:30,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 12:23:30,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 12:23:30,827 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:23:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:23:30,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:23:30,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:30,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:23:30,939 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:23:30,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:23:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:23:30,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:30,951 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-11-23 12:23:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:31,434 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 12:23:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:23:31,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:23:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 12:23:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 12:23:31,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-23 12:23:31,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:31,669 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:23:31,669 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:23:31,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:23:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 12:23:31,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:31,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 12:23:31,917 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 12:23:31,918 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 12:23:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:31,922 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:23:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:23:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:31,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:31,923 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 12:23:31,924 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 12:23:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:31,928 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:23:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:23:31,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:31,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:31,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:31,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:23:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 12:23:31,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-23 12:23:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:31,935 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 12:23:31,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:23:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:23:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:23:31,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:31,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:31,937 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:31,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash 622039550, now seen corresponding path program 1 times [2018-11-23 12:23:31,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:31,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:31,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:32,459 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 18 [2018-11-23 12:23:33,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {176#true} is VALID [2018-11-23 12:23:33,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {176#true} is VALID [2018-11-23 12:23:33,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-23 12:23:33,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #60#return; {176#true} is VALID [2018-11-23 12:23:33,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret8 := main(); {176#true} is VALID [2018-11-23 12:23:33,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {176#true} is VALID [2018-11-23 12:23:33,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {178#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:33,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {178#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {179#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:33,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {180#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:33,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {180#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {181#(and (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (or (= (select (select |#memory_int| |main_~#acopy~0.base|) 0) (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 2 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:33,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {181#(and (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (or (= (select (select |#memory_int| |main_~#acopy~0.base|) 0) (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 2 ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {182#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) 0) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:33,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {182#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) 0) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {183#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~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:23:33,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {183#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~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~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {184#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:23:33,069 INFO L256 TraceCheckUtils]: 13: Hoare triple {184#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {185#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:33,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {185#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {186#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:23:33,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {186#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2018-11-23 12:23:33,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {177#false} assume !false; {177#false} is VALID [2018-11-23 12:23:33,074 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:23:33,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:33,075 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:23:33,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:33,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:33,439 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 5 treesize of output 1 [2018-11-23 12:23:33,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 12:23:33,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-11-23 12:23:33,738 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-23 12:23:33,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,752 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 32 treesize of output 42 [2018-11-23 12:23:33,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,851 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:33,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:72, output treesize:50 [2018-11-23 12:23:34,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-23 12:23:34,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:34,554 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2018-11-23 12:23:34,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,569 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:23:34,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,586 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:3 [2018-11-23 12:23:34,589 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:34,589 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, ~SIZE~0, |main_~#acopy~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#a~0.base|)) (.cse4 (select |#memory_int| |main_~#acopy~0.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (select .cse2 0))) (and (= .cse0 .cse1) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (let ((.cse3 (+ (* 4 ~SIZE~0) (- 4)))) (= (select .cse2 .cse3) (select .cse4 .cse3))) (= .cse1 |main_#t~mem6|) (= .cse0 |main_#t~mem7|) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))) [2018-11-23 12:23:34,589 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 12:23:34,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {176#true} is VALID [2018-11-23 12:23:34,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {176#true} is VALID [2018-11-23 12:23:34,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-23 12:23:34,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #60#return; {176#true} is VALID [2018-11-23 12:23:34,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret8 := main(); {176#true} is VALID [2018-11-23 12:23:34,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {176#true} is VALID [2018-11-23 12:23:34,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {208#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:34,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {208#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {179#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:34,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {215#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:34,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {215#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:34,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {215#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:34,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {225#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:34,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {225#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (exists ((~SIZE~0 Int)) (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {184#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:23:34,658 INFO L256 TraceCheckUtils]: 13: Hoare triple {184#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {232#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:34,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {232#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {236#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:23:34,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {236#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {177#false} is VALID [2018-11-23 12:23:34,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {177#false} assume !false; {177#false} is VALID [2018-11-23 12:23:34,665 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:23:34,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:34,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-23 12:23:34,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-11-23 12:23:34,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:34,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:23:34,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:34,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:23:34,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:23:34,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:23:34,770 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 16 states. [2018-11-23 12:23:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:36,404 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:23:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:23:36,405 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-11-23 12:23:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:23:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-11-23 12:23:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:23:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-11-23 12:23:36,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2018-11-23 12:23:36,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:36,509 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:23:36,509 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:23:36,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:23:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:23:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 12:23:36,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:36,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 12:23:36,575 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 12:23:36,576 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 12:23:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:36,578 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:23:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:23:36,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:36,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:36,580 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 12:23:36,580 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 12:23:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:36,583 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:23:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:23:36,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:36,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:36,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:36,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:23:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 12:23:36,587 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2018-11-23 12:23:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:36,588 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 12:23:36,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:23:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:23:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:23:36,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:36,589 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] [2018-11-23 12:23:36,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:36,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1759623631, now seen corresponding path program 1 times [2018-11-23 12:23:36,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:36,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:36,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:36,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:36,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:37,164 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2018-11-23 12:23:37,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 12:23:37,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {399#true} is VALID [2018-11-23 12:23:37,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 12:23:37,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #60#return; {399#true} is VALID [2018-11-23 12:23:37,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret8 := main(); {399#true} is VALID [2018-11-23 12:23:37,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {399#true} is VALID [2018-11-23 12:23:37,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {401#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {401#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {402#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:37,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {402#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {403#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (or (< (+ (* 2 main_~i~0) 2) ~SIZE~0) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) |main_~#acopy~0.offset| (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (<= 2 ~SIZE~0))) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:37,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (or (< (+ (* 2 main_~i~0) 2) ~SIZE~0) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) |main_~#acopy~0.offset| (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (<= 2 ~SIZE~0))) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {404#(and (or (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 2 ~SIZE~0))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#(and (or (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 2 ~SIZE~0))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {405#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,833 INFO L256 TraceCheckUtils]: 13: Hoare triple {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {399#true} is VALID [2018-11-23 12:23:37,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#true} ~cond := #in~cond; {399#true} is VALID [2018-11-23 12:23:37,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {399#true} assume !(0 == ~cond); {399#true} is VALID [2018-11-23 12:23:37,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 12:23:37,837 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {399#true} {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #64#return; {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 ~SIZE~0) (+ (* 4 (+ (- ~SIZE~0) 2)) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 8) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {407#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:37,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {407#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {408#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:23:37,848 INFO L256 TraceCheckUtils]: 21: Hoare triple {408#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {409#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:37,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {409#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {410#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:23:37,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {410#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {400#false} is VALID [2018-11-23 12:23:37,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 12:23:37,855 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:23:37,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:37,855 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:23:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:37,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:37,958 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 5 treesize of output 1 [2018-11-23 12:23:37,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:37,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:37,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 12:23:38,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 12:23:38,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-23 12:23:38,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:38,221 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 46 treesize of output 63 [2018-11-23 12:23:38,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:38,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:38,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:38,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:38,268 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:65 [2018-11-23 12:23:40,778 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (let ((.cse3 (select |c_#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|))) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (let ((.cse1 (* (- 4) v_main_~i~0_12)) (.cse2 (* 4 ~SIZE~0))) (= (select .cse0 (+ .cse1 .cse2 (- 4))) (select .cse3 (+ .cse1 .cse2 |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4))))) (let ((.cse4 (* 4 v_main_~i~0_12))) (= (select .cse3 (+ .cse4 |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select .cse0 .cse4)))))) is different from true [2018-11-23 12:23:41,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 52 [2018-11-23 12:23:41,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:41,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:41,585 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:23:41,631 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-23 12:23:41,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-11-23 12:23:41,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:41,717 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:23:41,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 12:23:41,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:41,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:41,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:41,745 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:82, output treesize:3 [2018-11-23 12:23:41,750 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:41,751 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_~i~0_12, ~SIZE~0, |main_~#acopy~0.offset|, |#memory_int|, |main_~#acopy~0.base|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#acopy~0.base|)) (.cse2 (select |#memory_int| |main_~#a~0.base|))) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (let ((.cse1 (* 4 v_main_~i~0_12))) (= (select .cse0 (+ .cse1 |main_~#acopy~0.offset|)) (select .cse2 .cse1))) (let ((.cse3 (* (- 4) v_main_~i~0_12)) (.cse4 (* 4 ~SIZE~0))) (= (select .cse0 (+ .cse3 .cse4 |main_~#acopy~0.offset| (- 4))) (select .cse2 (+ .cse3 .cse4 (- 4))))) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= |main_#t~mem6| (select .cse0 (+ |main_~#acopy~0.offset| 4))) (= (select .cse2 4) |main_#t~mem7|))) [2018-11-23 12:23:41,751 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 12:23:41,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 12:23:41,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {399#true} is VALID [2018-11-23 12:23:41,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 12:23:41,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #60#return; {399#true} is VALID [2018-11-23 12:23:41,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret8 := main(); {399#true} is VALID [2018-11-23 12:23:41,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {399#true} is VALID [2018-11-23 12:23:41,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {432#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {436#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {436#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {440#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (<= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {440#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (<= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {444#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (exists ((v_main_~i~0_12 Int)) (and (<= main_~i~0 (+ v_main_~i~0_12 1)) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {444#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (exists ((v_main_~i~0_12 Int)) (and (<= main_~i~0 (+ v_main_~i~0_12 1)) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {448#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,839 INFO L256 TraceCheckUtils]: 13: Hoare triple {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} is VALID [2018-11-23 12:23:41,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} ~cond := #in~cond; {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} is VALID [2018-11-23 12:23:41,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} assume !(0 == ~cond); {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} is VALID [2018-11-23 12:23:41,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} assume true; {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} is VALID [2018-11-23 12:23:41,842 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {459#(exists ((v_main_~i~0_12 Int) (|v_main_~#acopy~0.base_BEFORE_CALL_1| Int) (~SIZE~0 Int) (|v_main_~#acopy~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |v_main_~#acopy~0.offset_BEFORE_CALL_1| (- 4)))) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_12) |v_main_~#acopy~0.offset_BEFORE_CALL_1|)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (* 4 v_main_~i~0_12)))))} {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #64#return; {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {452#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {478#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (= main_~i~0 1) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:41,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {478#(and (not (= |main_~#acopy~0.base| |main_~#a~0.base|)) (= main_~i~0 1) (exists ((v_main_~i~0_12 Int) (~SIZE~0 Int)) (and (<= (div ~SIZE~0 2) (+ v_main_~i~0_12 1)) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_12 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) v_main_~i~0_12) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {408#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:23:41,850 INFO L256 TraceCheckUtils]: 21: Hoare triple {408#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {485#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:41,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {485#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {489#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:23:41,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {489#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {400#false} is VALID [2018-11-23 12:23:41,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 12:23:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 12:23:41,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:41,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-11-23 12:23:41,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-11-23 12:23:41,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:41,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:23:42,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:42,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:23:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:23:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2018-11-23 12:23:42,055 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 22 states. [2018-11-23 12:24:03,274 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-11-23 12:24:16,139 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 12:24:22,248 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 12:24:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:54,449 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 12:24:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:24:54,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-11-23 12:24:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:24:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-11-23 12:24:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:24:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-11-23 12:24:54,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 51 transitions. [2018-11-23 12:24:56,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:56,611 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:24:56,611 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:24:56,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=4, NotChecked=62, Total=1122 [2018-11-23 12:24:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:24:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-11-23 12:24:56,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:56,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 39 states. [2018-11-23 12:24:56,808 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 39 states. [2018-11-23 12:24:56,808 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 39 states. [2018-11-23 12:24:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,815 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 12:24:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:24:56,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:56,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:56,816 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 52 states. [2018-11-23 12:24:56,816 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 52 states. [2018-11-23 12:24:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,820 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 12:24:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:24:56,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:56,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:56,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:56,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:24:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 12:24:56,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 25 [2018-11-23 12:24:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:56,825 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 12:24:56,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:24:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 12:24:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:24:56,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:56,827 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:24:56,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:56,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1636247343, now seen corresponding path program 2 times [2018-11-23 12:24:56,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:56,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:56,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:56,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:57,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2018-11-23 12:24:57,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {753#true} is VALID [2018-11-23 12:24:57,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {753#true} assume true; {753#true} is VALID [2018-11-23 12:24:57,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {753#true} {753#true} #60#return; {753#true} is VALID [2018-11-23 12:24:57,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret8 := main(); {753#true} is VALID [2018-11-23 12:24:57,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {753#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {753#true} is VALID [2018-11-23 12:24:57,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {753#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {755#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {755#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {756#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {756#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {756#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {756#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {757#(and (<= 1 main_~i~0) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {757#(and (<= 1 main_~i~0) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {758#(and (<= 1 main_~i~0) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {758#(and (<= 1 main_~i~0) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {759#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {759#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {759#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {759#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,365 INFO L256 TraceCheckUtils]: 15: Hoare triple {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {753#true} is VALID [2018-11-23 12:24:57,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {753#true} ~cond := #in~cond; {753#true} is VALID [2018-11-23 12:24:57,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {753#true} assume !(0 == ~cond); {753#true} is VALID [2018-11-23 12:24:57,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {753#true} assume true; {753#true} is VALID [2018-11-23 12:24:57,368 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {753#true} {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #64#return; {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {760#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {761#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:57,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {761#(and (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {762#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:24:57,388 INFO L256 TraceCheckUtils]: 23: Hoare triple {762#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:57,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {764#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:24:57,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {764#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {754#false} is VALID [2018-11-23 12:24:57,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {754#false} assume !false; {754#false} is VALID [2018-11-23 12:24:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:24:57,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:57,392 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:24:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:57,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:57,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:57,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:57,519 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 5 treesize of output 1 [2018-11-23 12:24:57,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:57,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:57,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 12:24:57,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2018-11-23 12:24:57,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-11-23 12:24:57,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:24:57,941 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 36 treesize of output 48 [2018-11-23 12:24:57,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:57,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:57,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:57,987 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:24:57,988 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2018-11-23 12:25:00,257 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|)) (.cse0 (select |c_#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|))) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (let ((.cse1 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (select .cse2 4) (select .cse0 4))))) is different from true [2018-11-23 12:25:00,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-23 12:25:00,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:25:00,673 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2018-11-23 12:25:00,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:25:00,686 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:25:00,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:25:00,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:25:00,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:25:00,699 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2018-11-23 12:25:00,702 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:25:00,702 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#acopy~0.base|, ~SIZE~0, |main_~#a~0.base|]. (let ((.cse4 (select |#memory_int| |main_~#a~0.base|)) (.cse2 (select |#memory_int| |main_~#acopy~0.base|))) (let ((.cse1 (select .cse2 4)) (.cse0 (select .cse4 4))) (and (= .cse0 .cse1) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= (mod ~SIZE~0 2) 0) (= .cse1 |main_#t~mem6|) (let ((.cse3 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse2 .cse3) (select .cse4 .cse3))) (= .cse0 |main_#t~mem7|)))) [2018-11-23 12:25:00,702 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 12:25:00,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2018-11-23 12:25:00,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {753#true} is VALID [2018-11-23 12:25:00,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {753#true} assume true; {753#true} is VALID [2018-11-23 12:25:00,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {753#true} {753#true} #60#return; {753#true} is VALID [2018-11-23 12:25:00,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret8 := main(); {753#true} is VALID [2018-11-23 12:25:00,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {753#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {753#true} is VALID [2018-11-23 12:25:00,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {753#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {755#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {755#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {789#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {789#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {789#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {789#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {796#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {796#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {800#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {800#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {800#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,758 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-23 12:25:00,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} ~cond := #in~cond; {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-23 12:25:00,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} assume !(0 == ~cond); {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-23 12:25:00,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} assume true; {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-23 12:25:00,760 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {817#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_2| Int) (~SIZE~0 Int)) (and (not (= |v_main_~#acopy~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_2|) 4))))} {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} #64#return; {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {810#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {836#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:25:00,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {836#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (= (mod ~SIZE~0 2) 0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {762#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:25:00,766 INFO L256 TraceCheckUtils]: 23: Hoare triple {762#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {843#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:25:00,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {843#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {847#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:25:00,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {847#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {754#false} is VALID [2018-11-23 12:25:00,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {754#false} assume !false; {754#false} is VALID [2018-11-23 12:25:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 12:25:00,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:00,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-11-23 12:25:00,793 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-23 12:25:00,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:00,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:25:00,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:00,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:25:00,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:25:00,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2018-11-23 12:25:00,871 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-11-23 12:25:44,010 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 12:26:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:21,046 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:26:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:26:21,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-23 12:26:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:26:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2018-11-23 12:26:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:26:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2018-11-23 12:26:21,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 61 transitions. [2018-11-23 12:26:21,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:21,177 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:26:21,177 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:26:21,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=4, NotChecked=46, Total=650 [2018-11-23 12:26:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:26:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2018-11-23 12:26:21,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:21,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 36 states. [2018-11-23 12:26:21,485 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 36 states. [2018-11-23 12:26:21,486 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 36 states. [2018-11-23 12:26:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:21,491 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-23 12:26:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-23 12:26:21,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:21,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:21,492 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 62 states. [2018-11-23 12:26:21,492 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 62 states. [2018-11-23 12:26:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:21,496 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-23 12:26:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-23 12:26:21,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:21,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:21,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:21,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:26:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:26:21,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2018-11-23 12:26:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:21,500 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:26:21,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:26:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:26:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:26:21,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:21,501 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] [2018-11-23 12:26:21,502 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:21,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash 114759524, now seen corresponding path program 3 times [2018-11-23 12:26:21,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:21,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:21,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:21,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:21,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:21,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-23 12:26:21,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1128#true} is VALID [2018-11-23 12:26:21,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 12:26:21,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #60#return; {1128#true} is VALID [2018-11-23 12:26:21,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret8 := main(); {1128#true} is VALID [2018-11-23 12:26:21,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {1128#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1128#true} is VALID [2018-11-23 12:26:21,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {1128#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {1130#(or (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:26:21,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {1130#(or (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {1131#(and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:26:21,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {1131#(and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1131#(and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:26:21,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {1131#(and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1132#(and (<= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:21,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {1132#(and (<= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {1133#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:26:21,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {1133#(<= ~SIZE~0 2)} ~i~0 := 0; {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:26:21,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:26:21,699 INFO L256 TraceCheckUtils]: 13: Hoare triple {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1128#true} is VALID [2018-11-23 12:26:21,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2018-11-23 12:26:21,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2018-11-23 12:26:21,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 12:26:21,701 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1128#true} {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #64#return; {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:26:21,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} havoc #t~mem7;havoc #t~mem6; {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:26:21,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {1134#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1135#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:26:21,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {1135#(<= ~SIZE~0 (+ main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1135#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:26:21,703 INFO L256 TraceCheckUtils]: 21: Hoare triple {1135#(<= ~SIZE~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1128#true} is VALID [2018-11-23 12:26:21,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2018-11-23 12:26:21,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2018-11-23 12:26:21,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 12:26:21,705 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1128#true} {1135#(<= ~SIZE~0 (+ main_~i~0 1))} #64#return; {1135#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:26:21,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {1135#(<= ~SIZE~0 (+ main_~i~0 1))} havoc #t~mem7;havoc #t~mem6; {1135#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:26:21,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {1135#(<= ~SIZE~0 (+ main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1136#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-23 12:26:21,707 INFO L273 TraceCheckUtils]: 28: Hoare triple {1136#(<= ~SIZE~0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1129#false} is VALID [2018-11-23 12:26:21,708 INFO L256 TraceCheckUtils]: 29: Hoare triple {1129#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1129#false} is VALID [2018-11-23 12:26:21,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2018-11-23 12:26:21,708 INFO L273 TraceCheckUtils]: 31: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2018-11-23 12:26:21,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-23 12:26:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:26:21,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:21,712 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:26:21,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:21,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:26:21,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:21,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:22,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-23 12:26:22,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1128#true} is VALID [2018-11-23 12:26:22,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 12:26:22,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #60#return; {1128#true} is VALID [2018-11-23 12:26:22,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret8 := main(); {1128#true} is VALID [2018-11-23 12:26:22,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {1128#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1128#true} is VALID [2018-11-23 12:26:22,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {1128#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {1158#(< 1 ~SIZE~0)} is VALID [2018-11-23 12:26:22,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {1158#(< 1 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {1162#(and (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 0))} is VALID [2018-11-23 12:26:22,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {1162#(and (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1162#(and (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 0))} is VALID [2018-11-23 12:26:22,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {1162#(and (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1169#(and (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:26:22,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {1169#(and (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0) (<= main_~i~0 1))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} ~i~0 := 0; {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,076 INFO L256 TraceCheckUtils]: 13: Hoare triple {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} ~cond := #in~cond; {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume !(0 == ~cond); {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume true; {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,087 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} #64#return; {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} havoc #t~mem7;havoc #t~mem6; {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#(and (<= 0 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,090 INFO L256 TraceCheckUtils]: 21: Hoare triple {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} ~cond := #in~cond; {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,091 INFO L273 TraceCheckUtils]: 23: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume !(0 == ~cond); {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume true; {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,093 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1173#(and (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} #64#return; {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} havoc #t~mem7;havoc #t~mem6; {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {1202#(and (<= 1 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1227#(and (<= 2 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} is VALID [2018-11-23 12:26:22,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#(and (<= 2 main_~i~0) (<= (div ~SIZE~0 2) 1) (< 1 ~SIZE~0) (= (mod ~SIZE~0 2) 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1129#false} is VALID [2018-11-23 12:26:22,097 INFO L256 TraceCheckUtils]: 29: Hoare triple {1129#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1129#false} is VALID [2018-11-23 12:26:22,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2018-11-23 12:26:22,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2018-11-23 12:26:22,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-23 12:26:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:26:22,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 12:26:22,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-11-23 12:26:22,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:22,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:26:22,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:22,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:26:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:26:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:26:22,189 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2018-11-23 12:26:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:23,379 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 12:26:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:26:23,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-11-23 12:26:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:26:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 12:26:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:26:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 12:26:23,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2018-11-23 12:26:23,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:23,522 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:26:23,522 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:26:23,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:26:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:26:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 12:26:23,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:23,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 12:26:23,770 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 12:26:23,771 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 12:26:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:23,773 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:26:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:26:23,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:23,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:23,774 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 12:26:23,774 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 12:26:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:23,776 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:26:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:26:23,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:23,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:23,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:23,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:26:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 12:26:23,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2018-11-23 12:26:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:23,780 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 12:26:23,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:26:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:26:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:26:23,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:23,781 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:23,781 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:23,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -431613342, now seen corresponding path program 4 times [2018-11-23 12:26:23,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:23,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:23,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:24,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {1475#true} call ULTIMATE.init(); {1475#true} is VALID [2018-11-23 12:26:24,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {1475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1475#true} is VALID [2018-11-23 12:26:24,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-23 12:26:24,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1475#true} {1475#true} #60#return; {1475#true} is VALID [2018-11-23 12:26:24,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {1475#true} call #t~ret8 := main(); {1475#true} is VALID [2018-11-23 12:26:24,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {1475#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1475#true} is VALID [2018-11-23 12:26:24,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {1475#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {1477#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {1477#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {1478#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (< 0 (+ ~SIZE~0 1)) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {1478#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (< 0 (+ ~SIZE~0 1)) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1478#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (< 0 (+ ~SIZE~0 1)) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {1478#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (< 0 (+ ~SIZE~0 1)) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1479#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (<= (+ (* 2 (div ~SIZE~0 2)) 1) (+ main_~i~0 ~SIZE~0)) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {1479#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (<= (+ (* 2 (div ~SIZE~0 2)) 1) (+ main_~i~0 ~SIZE~0)) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1480#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) |main_~#acopy~0.offset| (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (< 0 (+ ~SIZE~0 1)) (<= (+ main_~i~0 3) ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {1480#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) |main_~#acopy~0.offset| (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (< 0 (+ ~SIZE~0 1)) (<= (+ main_~i~0 3) ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1481#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= (* 8 main_~i~0) (* 4 ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (or (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (* (- 2) main_~i~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 8 main_~i~0) 1) (* 4 ~SIZE~0))) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {1481#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= (* 8 main_~i~0) (* 4 ~SIZE~0)) (< 0 (+ ~SIZE~0 1)) (or (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (* (- 2) main_~i~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 8 main_~i~0) 1) (* 4 ~SIZE~0))) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {1482#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {1482#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,922 INFO L256 TraceCheckUtils]: 15: Hoare triple {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1475#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-23 12:26:24,925 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1475#true} {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #64#return; {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,926 INFO L273 TraceCheckUtils]: 20: Hoare triple {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {1483#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ (- ~SIZE~0) 3)) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* (- 4) ~SIZE~0) 12) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,929 INFO L256 TraceCheckUtils]: 23: Hoare triple {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1475#true} is VALID [2018-11-23 12:26:24,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2018-11-23 12:26:24,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2018-11-23 12:26:24,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-23 12:26:24,932 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1475#true} {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} #64#return; {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {1484#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (+ (* 4 (+ main_~i~0 (+ (- ~SIZE~0) 2))) (+ (* 4 ~SIZE~0) (- 4))))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#acopy~0.offset| (+ (+ (* 4 main_~i~0) (+ (* (- 4) ~SIZE~0) 8)) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1485#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:24,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {1485#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1486#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:26:24,945 INFO L256 TraceCheckUtils]: 31: Hoare triple {1486#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1487#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:26:24,946 INFO L273 TraceCheckUtils]: 32: Hoare triple {1487#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1488#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:26:24,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {1488#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1476#false} is VALID [2018-11-23 12:26:24,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2018-11-23 12:26:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:26:24,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:24,957 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:26:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:25,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:25,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:25,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:25,092 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 5 treesize of output 1 [2018-11-23 12:26:25,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:26:25,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:26:25,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 12:26:25,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 12:26:25,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-23 12:26:25,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:26:25,423 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 46 treesize of output 63 [2018-11-23 12:26:25,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:26:25,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:26:25,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:26:25,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:26:25,466 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:207, output treesize:70 [2018-11-23 12:26:27,834 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|)) (.cse0 (select |c_#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|)) (.cse3 (div ~SIZE~0 2))) (and (let ((.cse1 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (select .cse2 4) (select .cse0 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= .cse3 2) (= (mod ~SIZE~0 2) 0) (< 1 .cse3)))) is different from true [2018-11-23 12:26:30,108 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|)) (.cse1 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|)) (.cse2 (div ~SIZE~0 2))) (and (= (select .cse0 4) (select .cse1 4)) (<= .cse2 2) (= (mod ~SIZE~0 2) 0) (let ((.cse3 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse3) (select .cse1 .cse3))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 .cse2)))) is different from true [2018-11-23 12:26:30,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-23 12:26:30,405 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:26:30,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 12:26:30,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:26:30,423 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:26:30,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:26:30,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:26:30,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:26:30,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:26:30,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:3 [2018-11-23 12:26:30,486 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:26:30,486 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#acopy~0.base|, ~SIZE~0, |main_~#a~0.base|]. (let ((.cse1 (select |#memory_int| |main_~#acopy~0.base|)) (.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse2 (div ~SIZE~0 2))) (and (= (select .cse0 4) (select .cse1 4)) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= (select .cse0 8) |main_#t~mem7|) (<= .cse2 2) (= (mod ~SIZE~0 2) 0) (= (select .cse1 8) |main_#t~mem6|) (let ((.cse3 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse1 .cse3) (select .cse0 .cse3))) (< 1 .cse2))) [2018-11-23 12:26:30,487 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 12:26:30,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {1475#true} call ULTIMATE.init(); {1475#true} is VALID [2018-11-23 12:26:30,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1475#true} is VALID [2018-11-23 12:26:30,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-23 12:26:30,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1475#true} {1475#true} #60#return; {1475#true} is VALID [2018-11-23 12:26:30,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {1475#true} call #t~ret8 := main(); {1475#true} is VALID [2018-11-23 12:26:30,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {1475#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1475#true} is VALID [2018-11-23 12:26:30,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {1475#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {1477#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {1477#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 0; {1513#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {1513#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1513#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {1513#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1520#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 1) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {1520#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (mod ~SIZE~0 2) 0) (= main_~i~0 1) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#acopy~0.base, ~#acopy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);havoc #t~mem3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1524#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (< main_~i~0 (div ~SIZE~0 2)) (= (mod ~SIZE~0 2) 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {1524#(and (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (< main_~i~0 (div ~SIZE~0 2)) (= (mod ~SIZE~0 2) 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 main_~i~0) |main_~#acopy~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 4)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1528#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (<= main_~i~0 2) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {1528#(and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (<= main_~i~0 2) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {1532#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {1532#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,579 INFO L256 TraceCheckUtils]: 15: Hoare triple {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} ~cond := #in~cond; {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} assume !(0 == ~cond); {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} assume true; {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,583 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1543#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_3| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ (* 4 ~SIZE~0) (- 8)))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4) (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_3|) 4)) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2))))} {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #64#return; {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {1536#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,590 INFO L256 TraceCheckUtils]: 23: Hoare triple {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} ~cond := #in~cond; {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} assume !(0 == ~cond); {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} assume true; {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} is VALID [2018-11-23 12:26:30,593 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1569#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#acopy~0.base_BEFORE_CALL_4| Int) (~SIZE~0 Int)) (and (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (= (select (select |#memory_int| |v_main_~#acopy~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ (* 4 ~SIZE~0) (- 8)))) (not (= |v_main_~#acopy~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (< 1 (div ~SIZE~0 2))))} {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #64#return; {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {1562#(and (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1588#(and (= main_~i~0 2) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:26:30,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {1588#(and (= main_~i~0 2) (exists ((~SIZE~0 Int)) (and (= (select (select |#memory_int| |main_~#acopy~0.base|) (+ (* 4 ~SIZE~0) |main_~#acopy~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 ~SIZE~0) |main_~#a~0.offset| (- 8)))) (<= (div ~SIZE~0 2) 2) (= (mod ~SIZE~0 2) 0) (< 1 (div ~SIZE~0 2)))) (not (= |main_~#a~0.base| |main_~#acopy~0.base|)) (= |main_~#acopy~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#acopy~0.base|) (+ |main_~#acopy~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#acopy~0.base, ~#acopy~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1486#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 12:26:30,598 INFO L256 TraceCheckUtils]: 31: Hoare triple {1486#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1595#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:26:30,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {1595#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1599#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:26:30,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {1599#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1476#false} is VALID [2018-11-23 12:26:30,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2018-11-23 12:26:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-23 12:26:30,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:30,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-11-23 12:26:30,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2018-11-23 12:26:30,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:30,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:26:30,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:30,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:26:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:26:30,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=479, Unknown=2, NotChecked=90, Total=650 [2018-11-23 12:26:30,837 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 26 states.