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-examples/standard_two_index_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:06:18,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:06:18,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:06:18,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:06:18,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:06:18,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:06:18,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:06:18,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:06:18,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:06:18,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:06:18,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:06:18,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:06:18,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:06:18,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:06:18,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:06:18,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:06:18,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:06:18,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:06:18,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:06:18,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:06:18,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:06:18,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:06:18,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:06:18,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:06:18,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:06:18,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:06:18,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:06:18,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:06:18,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:06:18,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:06:18,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:06:18,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:06:18,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:06:18,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:06:18,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:06:18,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:06:18,921 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:06:18,935 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:06:18,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:06:18,936 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:06:18,937 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:06:18,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:06:18,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:06:18,938 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:06:18,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:06:18,938 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:06:18,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:06:18,938 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:06:18,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:06:18,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:06:18,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:06:18,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:06:18,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:06:18,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:06:18,940 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:06:18,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:06:18,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:06:18,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:06:18,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:06:18,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:06:18,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:18,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:06:18,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:06:18,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:06:18,942 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:06:18,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:06:18,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:06:18,942 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:06:19,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:06:19,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:06:19,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:06:19,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:06:19,037 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:06:19,038 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i [2018-11-23 12:06:19,100 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2df7e7b/6d14bd2c4f7c4f7ab39ef88988af8bef/FLAG8823fb85b [2018-11-23 12:06:19,566 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:06:19,566 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i [2018-11-23 12:06:19,573 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2df7e7b/6d14bd2c4f7c4f7ab39ef88988af8bef/FLAG8823fb85b [2018-11-23 12:06:19,932 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2df7e7b/6d14bd2c4f7c4f7ab39ef88988af8bef [2018-11-23 12:06:19,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:06:19,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:06:19,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:19,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:06:19,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:06:19,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:19" (1/1) ... [2018-11-23 12:06:19,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1065b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:19, skipping insertion in model container [2018-11-23 12:06:19,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:19" (1/1) ... [2018-11-23 12:06:19,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:06:19,993 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:06:20,187 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:20,192 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:06:20,231 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:20,255 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:06:20,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20 WrapperNode [2018-11-23 12:06:20,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:20,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:20,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:06:20,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:06:20,265 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:06:20" (1/1) ... [2018-11-23 12:06:20,274 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:06:20" (1/1) ... [2018-11-23 12:06:20,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:20,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:06:20,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:06:20,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:06:20,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (1/1) ... [2018-11-23 12:06:20,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:06:20,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:06:20,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:06:20,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:06:20,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (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:06:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:06:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:06:20,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:06:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:06:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:06:20,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:06:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:06:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:06:20,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:06:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:06:20,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:06:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:06:20,955 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:06:20,956 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:06:20,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:20 BoogieIcfgContainer [2018-11-23 12:06:20,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:06:20,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:06:20,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:06:20,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:06:20,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:06:19" (1/3) ... [2018-11-23 12:06:20,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff50d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:20, skipping insertion in model container [2018-11-23 12:06:20,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:20" (2/3) ... [2018-11-23 12:06:20,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff50d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:20, skipping insertion in model container [2018-11-23 12:06:20,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:20" (3/3) ... [2018-11-23 12:06:20,967 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_01_true-unreach-call.i [2018-11-23 12:06:20,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:06:20,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:06:21,001 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:06:21,034 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:06:21,035 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:06:21,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:06:21,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:06:21,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:06:21,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:06:21,036 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:06:21,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:06:21,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:06:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:06:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:06:21,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:21,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:21,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:21,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 12:06:21,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:21,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:21,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:06:21,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:06:21,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:06:21,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 12:06:21,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 12:06:21,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {27#true} is VALID [2018-11-23 12:06:21,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 12:06:21,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 0; {28#false} is VALID [2018-11-23 12:06:21,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !(~i~0 < 10000); {28#false} is VALID [2018-11-23 12:06:21,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 0;~j~0 := 0; {28#false} is VALID [2018-11-23 12:06:21,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {28#false} is VALID [2018-11-23 12:06:21,222 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {28#false} is VALID [2018-11-23 12:06:21,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 12:06:21,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 12:06:21,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:06:21,227 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:06:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:21,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:06:21,235 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:06:21,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:21,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:06:21,348 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:06:21,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:06:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:06:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:21,360 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 12:06:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,581 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 12:06:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:06:21,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:06:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:06:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:06:21,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:06:22,029 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:06:22,042 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:06:22,042 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:06:22,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:06:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:06:22,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:22,106 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:22,106 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,110 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:06:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:06:22,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,111 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:22,111 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,116 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:06:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:06:22,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 12:06:22,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 12:06:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,126 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 12:06:22,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:06:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:06:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:06:22,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:22,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:22,128 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:22,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 12:06:22,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:22,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 12:06:22,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {151#true} is VALID [2018-11-23 12:06:22,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 12:06:22,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #60#return; {151#true} is VALID [2018-11-23 12:06:22,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2018-11-23 12:06:22,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {153#(= main_~i~0 0)} is VALID [2018-11-23 12:06:22,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(= main_~i~0 0)} assume !(~i~0 < 10000); {152#false} is VALID [2018-11-23 12:06:22,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 0; {152#false} is VALID [2018-11-23 12:06:22,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {152#false} assume !(~i~0 < 10000); {152#false} is VALID [2018-11-23 12:06:22,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {152#false} ~i~0 := 0;~j~0 := 0; {152#false} is VALID [2018-11-23 12:06:22,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {152#false} is VALID [2018-11-23 12:06:22,235 INFO L256 TraceCheckUtils]: 11: Hoare triple {152#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {152#false} is VALID [2018-11-23 12:06:22,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2018-11-23 12:06:22,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2018-11-23 12:06:22,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 12:06:22,237 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:06:22,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:22,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:06:22,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:06:22,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:22,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:06:22,359 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:06:22,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:06:22,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:06:22,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:22,361 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 12:06:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,532 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 12:06:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:06:22,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:06:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 12:06:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 12:06:22,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 12:06:22,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,698 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:06:22,700 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:06:22,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:06:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-23 12:06:22,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 21 states. [2018-11-23 12:06:22,870 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 21 states. [2018-11-23 12:06:22,870 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 21 states. [2018-11-23 12:06:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,874 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:06:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:06:22,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,876 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states. [2018-11-23 12:06:22,876 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states. [2018-11-23 12:06:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,879 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:06:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:06:22,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:06:22,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-23 12:06:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,884 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:06:22,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:06:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:06:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:06:22,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:22,885 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:06:22,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:22,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2018-11-23 12:06:22,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:22,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:22,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:06:23,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:06:23,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:06:23,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #60#return; {289#true} is VALID [2018-11-23 12:06:23,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret4 := main(); {289#true} is VALID [2018-11-23 12:06:23,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {291#(= main_~i~0 0)} is VALID [2018-11-23 12:06:23,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {292#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:23,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 1)} assume !(~i~0 < 10000); {290#false} is VALID [2018-11-23 12:06:23,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#false} ~i~0 := 0; {290#false} is VALID [2018-11-23 12:06:23,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {290#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {290#false} is VALID [2018-11-23 12:06:23,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {290#false} assume !(~i~0 < 10000); {290#false} is VALID [2018-11-23 12:06:23,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {290#false} ~i~0 := 0;~j~0 := 0; {290#false} is VALID [2018-11-23 12:06:23,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {290#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {290#false} is VALID [2018-11-23 12:06:23,045 INFO L256 TraceCheckUtils]: 13: Hoare triple {290#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {290#false} is VALID [2018-11-23 12:06:23,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2018-11-23 12:06:23,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2018-11-23 12:06:23,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:06:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:06:23,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:23,048 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:06:23,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:23,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:06:23,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:06:23,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:06:23,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #60#return; {289#true} is VALID [2018-11-23 12:06:23,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret4 := main(); {289#true} is VALID [2018-11-23 12:06:23,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {311#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:23,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {292#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:23,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 1)} assume !(~i~0 < 10000); {290#false} is VALID [2018-11-23 12:06:23,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#false} ~i~0 := 0; {290#false} is VALID [2018-11-23 12:06:23,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {290#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {290#false} is VALID [2018-11-23 12:06:23,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {290#false} assume !(~i~0 < 10000); {290#false} is VALID [2018-11-23 12:06:23,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {290#false} ~i~0 := 0;~j~0 := 0; {290#false} is VALID [2018-11-23 12:06:23,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {290#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {290#false} is VALID [2018-11-23 12:06:23,379 INFO L256 TraceCheckUtils]: 13: Hoare triple {290#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {290#false} is VALID [2018-11-23 12:06:23,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2018-11-23 12:06:23,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2018-11-23 12:06:23,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:06:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:06:23,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:23,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:06:23,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:06:23,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:23,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:06:23,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:06:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:06:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:23,451 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 12:06:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,158 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:06:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:06:24,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:06:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-23 12:06:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-23 12:06:24,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2018-11-23 12:06:24,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:24,273 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:06:24,273 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:06:24,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:06:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-11-23 12:06:24,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:24,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 23 states. [2018-11-23 12:06:24,298 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 23 states. [2018-11-23 12:06:24,299 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 23 states. [2018-11-23 12:06:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,302 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:06:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:06:24,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,303 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 29 states. [2018-11-23 12:06:24,303 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 29 states. [2018-11-23 12:06:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,306 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:06:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:06:24,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:24,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:06:24,310 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2018-11-23 12:06:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:24,310 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:06:24,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:06:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:06:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:06:24,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:24,312 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:24,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:24,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash -406079354, now seen corresponding path program 2 times [2018-11-23 12:06:24,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:24,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-23 12:06:24,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {502#true} is VALID [2018-11-23 12:06:24,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-23 12:06:24,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #60#return; {502#true} is VALID [2018-11-23 12:06:24,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret4 := main(); {502#true} is VALID [2018-11-23 12:06:24,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {504#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {505#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {505#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {506#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {506#(<= main_~i~0 2)} assume !(~i~0 < 10000); {503#false} is VALID [2018-11-23 12:06:24,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {503#false} ~i~0 := 0; {503#false} is VALID [2018-11-23 12:06:24,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {503#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {503#false} is VALID [2018-11-23 12:06:24,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {503#false} is VALID [2018-11-23 12:06:24,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#false} assume !(~i~0 < 10000); {503#false} is VALID [2018-11-23 12:06:24,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#false} ~i~0 := 0;~j~0 := 0; {503#false} is VALID [2018-11-23 12:06:24,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {503#false} is VALID [2018-11-23 12:06:24,497 INFO L256 TraceCheckUtils]: 15: Hoare triple {503#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {503#false} is VALID [2018-11-23 12:06:24,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {503#false} ~cond := #in~cond; {503#false} is VALID [2018-11-23 12:06:24,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {503#false} assume 0 == ~cond; {503#false} is VALID [2018-11-23 12:06:24,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-23 12:06:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:24,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:24,499 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:06:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:24,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:24,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:24,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-23 12:06:24,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {502#true} is VALID [2018-11-23 12:06:24,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-23 12:06:24,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #60#return; {502#true} is VALID [2018-11-23 12:06:24,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret4 := main(); {502#true} is VALID [2018-11-23 12:06:24,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {525#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:24,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {525#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {505#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {505#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {506#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {506#(<= main_~i~0 2)} assume !(~i~0 < 10000); {503#false} is VALID [2018-11-23 12:06:24,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {503#false} ~i~0 := 0; {503#false} is VALID [2018-11-23 12:06:24,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {503#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {503#false} is VALID [2018-11-23 12:06:24,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {503#false} is VALID [2018-11-23 12:06:24,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#false} assume !(~i~0 < 10000); {503#false} is VALID [2018-11-23 12:06:24,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#false} ~i~0 := 0;~j~0 := 0; {503#false} is VALID [2018-11-23 12:06:24,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {503#false} is VALID [2018-11-23 12:06:24,650 INFO L256 TraceCheckUtils]: 15: Hoare triple {503#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {503#false} is VALID [2018-11-23 12:06:24,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {503#false} ~cond := #in~cond; {503#false} is VALID [2018-11-23 12:06:24,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {503#false} assume 0 == ~cond; {503#false} is VALID [2018-11-23 12:06:24,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-23 12:06:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:24,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:06:24,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:06:24,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:24,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:06:24,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:24,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:06:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:06:24,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:24,708 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 12:06:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,933 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 12:06:24,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:06:24,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:06:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:06:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:06:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:06:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:06:24,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-23 12:06:25,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,025 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:06:25,025 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:06:25,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:06:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2018-11-23 12:06:25,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:25,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 25 states. [2018-11-23 12:06:25,056 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 25 states. [2018-11-23 12:06:25,056 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 25 states. [2018-11-23 12:06:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,059 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:06:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:06:25,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,060 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 34 states. [2018-11-23 12:06:25,061 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 34 states. [2018-11-23 12:06:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,064 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:06:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:06:25,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:25,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:06:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 12:06:25,067 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-23 12:06:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:25,068 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 12:06:25,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:06:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 12:06:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:06:25,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:25,069 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:25,069 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:25,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash -820912923, now seen corresponding path program 3 times [2018-11-23 12:06:25,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:25,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:25,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:25,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2018-11-23 12:06:25,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {747#true} is VALID [2018-11-23 12:06:25,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2018-11-23 12:06:25,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #60#return; {747#true} is VALID [2018-11-23 12:06:25,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret4 := main(); {747#true} is VALID [2018-11-23 12:06:25,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {747#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {749#(= main_~i~0 0)} is VALID [2018-11-23 12:06:25,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {749#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {750#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {751#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {751#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {752#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {752#(<= main_~i~0 3)} assume !(~i~0 < 10000); {748#false} is VALID [2018-11-23 12:06:25,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {748#false} ~i~0 := 0; {748#false} is VALID [2018-11-23 12:06:25,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {748#false} is VALID [2018-11-23 12:06:25,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {748#false} is VALID [2018-11-23 12:06:25,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {748#false} is VALID [2018-11-23 12:06:25,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {748#false} assume !(~i~0 < 10000); {748#false} is VALID [2018-11-23 12:06:25,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {748#false} ~i~0 := 0;~j~0 := 0; {748#false} is VALID [2018-11-23 12:06:25,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {748#false} is VALID [2018-11-23 12:06:25,228 INFO L256 TraceCheckUtils]: 17: Hoare triple {748#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {748#false} is VALID [2018-11-23 12:06:25,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2018-11-23 12:06:25,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {748#false} assume 0 == ~cond; {748#false} is VALID [2018-11-23 12:06:25,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#false} assume !false; {748#false} is VALID [2018-11-23 12:06:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:06:25,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:25,231 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:06:25,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:25,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:06:25,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:25,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:25,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2018-11-23 12:06:25,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {747#true} is VALID [2018-11-23 12:06:25,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2018-11-23 12:06:25,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #60#return; {747#true} is VALID [2018-11-23 12:06:25,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret4 := main(); {747#true} is VALID [2018-11-23 12:06:25,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {747#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {771#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:25,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {771#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {750#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {751#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {751#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {752#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {752#(<= main_~i~0 3)} assume !(~i~0 < 10000); {748#false} is VALID [2018-11-23 12:06:25,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {748#false} ~i~0 := 0; {748#false} is VALID [2018-11-23 12:06:25,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {748#false} is VALID [2018-11-23 12:06:25,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {748#false} is VALID [2018-11-23 12:06:25,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {748#false} is VALID [2018-11-23 12:06:25,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {748#false} assume !(~i~0 < 10000); {748#false} is VALID [2018-11-23 12:06:25,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {748#false} ~i~0 := 0;~j~0 := 0; {748#false} is VALID [2018-11-23 12:06:25,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {748#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {748#false} is VALID [2018-11-23 12:06:25,425 INFO L256 TraceCheckUtils]: 17: Hoare triple {748#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {748#false} is VALID [2018-11-23 12:06:25,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2018-11-23 12:06:25,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {748#false} assume 0 == ~cond; {748#false} is VALID [2018-11-23 12:06:25,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#false} assume !false; {748#false} is VALID [2018-11-23 12:06:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:06:25,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:25,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:06:25,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:06:25,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:25,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:06:25,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:06:25,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:06:25,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:06:25,469 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-11-23 12:06:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,717 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 12:06:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:06:25,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:06:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2018-11-23 12:06:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2018-11-23 12:06:25,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2018-11-23 12:06:25,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,888 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:06:25,889 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:06:25,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:06:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:06:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2018-11-23 12:06:25,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:25,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 27 states. [2018-11-23 12:06:25,908 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 27 states. [2018-11-23 12:06:25,908 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 27 states. [2018-11-23 12:06:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,911 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 12:06:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:06:25,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,913 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 39 states. [2018-11-23 12:06:25,913 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 39 states. [2018-11-23 12:06:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,916 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 12:06:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:06:25,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:25,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:06:25,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2018-11-23 12:06:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:25,920 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:06:25,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:06:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:06:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:06:25,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:25,922 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:25,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:25,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1912151398, now seen corresponding path program 4 times [2018-11-23 12:06:25,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:25,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 12:06:26,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1024#true} is VALID [2018-11-23 12:06:26,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 12:06:26,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2018-11-23 12:06:26,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret4 := main(); {1024#true} is VALID [2018-11-23 12:06:26,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1026#(= main_~i~0 0)} is VALID [2018-11-23 12:06:26,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {1026#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1027#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {1027#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1028#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1029#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {1029#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1030#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#(<= main_~i~0 4)} assume !(~i~0 < 10000); {1025#false} is VALID [2018-11-23 12:06:26,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {1025#false} ~i~0 := 0; {1025#false} is VALID [2018-11-23 12:06:26,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {1025#false} assume !(~i~0 < 10000); {1025#false} is VALID [2018-11-23 12:06:26,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {1025#false} ~i~0 := 0;~j~0 := 0; {1025#false} is VALID [2018-11-23 12:06:26,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {1025#false} is VALID [2018-11-23 12:06:26,084 INFO L256 TraceCheckUtils]: 19: Hoare triple {1025#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1025#false} is VALID [2018-11-23 12:06:26,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2018-11-23 12:06:26,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2018-11-23 12:06:26,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 12:06:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:06:26,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:26,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:06:26,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:26,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:26,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:26,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 12:06:26,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1024#true} is VALID [2018-11-23 12:06:26,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 12:06:26,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2018-11-23 12:06:26,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret4 := main(); {1024#true} is VALID [2018-11-23 12:06:26,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1049#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:26,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {1049#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1027#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {1027#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1028#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1029#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {1029#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1030#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#(<= main_~i~0 4)} assume !(~i~0 < 10000); {1025#false} is VALID [2018-11-23 12:06:26,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {1025#false} ~i~0 := 0; {1025#false} is VALID [2018-11-23 12:06:26,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1025#false} is VALID [2018-11-23 12:06:26,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {1025#false} assume !(~i~0 < 10000); {1025#false} is VALID [2018-11-23 12:06:26,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {1025#false} ~i~0 := 0;~j~0 := 0; {1025#false} is VALID [2018-11-23 12:06:26,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {1025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {1025#false} is VALID [2018-11-23 12:06:26,445 INFO L256 TraceCheckUtils]: 19: Hoare triple {1025#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1025#false} is VALID [2018-11-23 12:06:26,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2018-11-23 12:06:26,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2018-11-23 12:06:26,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 12:06:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:06:26,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:06:26,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:06:26,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:26,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:06:26,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:06:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:06:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:06:26,527 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-23 12:06:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,833 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 12:06:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:06:26,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:06:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:06:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 12:06:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:06:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 12:06:26,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-23 12:06:26,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,972 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:06:26,972 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:06:26,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:06:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:06:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-11-23 12:06:27,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:27,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 29 states. [2018-11-23 12:06:27,018 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 29 states. [2018-11-23 12:06:27,019 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 29 states. [2018-11-23 12:06:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,022 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 12:06:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:06:27,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:27,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:27,023 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 44 states. [2018-11-23 12:06:27,023 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 44 states. [2018-11-23 12:06:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,026 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 12:06:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:06:27,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:27,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:27,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:27,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 12:06:27,029 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2018-11-23 12:06:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:27,030 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 12:06:27,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:06:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 12:06:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:06:27,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:27,031 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:27,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:27,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 378570245, now seen corresponding path program 5 times [2018-11-23 12:06:27,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:27,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:27,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-23 12:06:27,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1333#true} is VALID [2018-11-23 12:06:27,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-23 12:06:27,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #60#return; {1333#true} is VALID [2018-11-23 12:06:27,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret4 := main(); {1333#true} is VALID [2018-11-23 12:06:27,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1335#(= main_~i~0 0)} is VALID [2018-11-23 12:06:27,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {1335#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1336#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {1336#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1337#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {1337#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1338#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {1338#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1339#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1340#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {1340#(<= main_~i~0 5)} assume !(~i~0 < 10000); {1334#false} is VALID [2018-11-23 12:06:27,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {1334#false} ~i~0 := 0; {1334#false} is VALID [2018-11-23 12:06:27,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {1334#false} assume !(~i~0 < 10000); {1334#false} is VALID [2018-11-23 12:06:27,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {1334#false} ~i~0 := 0;~j~0 := 0; {1334#false} is VALID [2018-11-23 12:06:27,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {1334#false} is VALID [2018-11-23 12:06:27,261 INFO L256 TraceCheckUtils]: 21: Hoare triple {1334#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1334#false} is VALID [2018-11-23 12:06:27,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2018-11-23 12:06:27,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2018-11-23 12:06:27,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-23 12:06:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:06:27,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:27,264 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:06:27,280 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:27,402 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:06:27,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:27,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-23 12:06:27,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1333#true} is VALID [2018-11-23 12:06:27,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-23 12:06:27,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #60#return; {1333#true} is VALID [2018-11-23 12:06:27,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret4 := main(); {1333#true} is VALID [2018-11-23 12:06:27,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1359#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:27,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {1359#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1336#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {1336#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1337#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {1337#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1338#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {1338#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1339#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1340#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {1340#(<= main_~i~0 5)} assume !(~i~0 < 10000); {1334#false} is VALID [2018-11-23 12:06:27,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {1334#false} ~i~0 := 0; {1334#false} is VALID [2018-11-23 12:06:27,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1334#false} is VALID [2018-11-23 12:06:27,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {1334#false} assume !(~i~0 < 10000); {1334#false} is VALID [2018-11-23 12:06:27,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1334#false} ~i~0 := 0;~j~0 := 0; {1334#false} is VALID [2018-11-23 12:06:27,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {1334#false} is VALID [2018-11-23 12:06:27,620 INFO L256 TraceCheckUtils]: 21: Hoare triple {1334#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1334#false} is VALID [2018-11-23 12:06:27,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2018-11-23 12:06:27,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2018-11-23 12:06:27,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-23 12:06:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:06:27,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:06:27,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 12:06:27,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:27,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:06:27,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:27,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:06:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:06:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:06:27,699 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-11-23 12:06:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,240 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-23 12:06:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:06:28,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 12:06:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:06:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2018-11-23 12:06:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:06:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2018-11-23 12:06:28,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2018-11-23 12:06:28,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:28,384 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:06:28,384 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:06:28,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:06:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:06:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2018-11-23 12:06:28,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:28,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 31 states. [2018-11-23 12:06:28,437 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 31 states. [2018-11-23 12:06:28,437 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 31 states. [2018-11-23 12:06:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,440 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:06:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:06:28,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:28,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:28,442 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 49 states. [2018-11-23 12:06:28,442 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 49 states. [2018-11-23 12:06:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,445 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:06:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:06:28,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:28,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:28,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:28,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:06:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 12:06:28,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2018-11-23 12:06:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:28,448 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 12:06:28,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:06:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:06:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:06:28,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:28,449 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:28,449 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:28,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1539667386, now seen corresponding path program 6 times [2018-11-23 12:06:28,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:28,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:28,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:28,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {1674#true} call ULTIMATE.init(); {1674#true} is VALID [2018-11-23 12:06:28,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {1674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1674#true} is VALID [2018-11-23 12:06:28,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {1674#true} assume true; {1674#true} is VALID [2018-11-23 12:06:28,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1674#true} {1674#true} #60#return; {1674#true} is VALID [2018-11-23 12:06:28,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {1674#true} call #t~ret4 := main(); {1674#true} is VALID [2018-11-23 12:06:28,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {1674#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1676#(= main_~i~0 0)} is VALID [2018-11-23 12:06:28,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {1676#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1677#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {1677#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1678#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:28,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1679#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:28,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {1679#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1680#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:28,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {1680#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1681#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:28,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1682#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:28,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~0 6)} assume !(~i~0 < 10000); {1675#false} is VALID [2018-11-23 12:06:28,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {1675#false} ~i~0 := 0; {1675#false} is VALID [2018-11-23 12:06:28,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:28,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:28,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:28,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:28,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:28,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:28,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {1675#false} assume !(~i~0 < 10000); {1675#false} is VALID [2018-11-23 12:06:28,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {1675#false} ~i~0 := 0;~j~0 := 0; {1675#false} is VALID [2018-11-23 12:06:28,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {1675#false} is VALID [2018-11-23 12:06:28,695 INFO L256 TraceCheckUtils]: 23: Hoare triple {1675#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1675#false} is VALID [2018-11-23 12:06:28,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {1675#false} ~cond := #in~cond; {1675#false} is VALID [2018-11-23 12:06:28,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {1675#false} assume 0 == ~cond; {1675#false} is VALID [2018-11-23 12:06:28,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {1675#false} assume !false; {1675#false} is VALID [2018-11-23 12:06:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:06:28,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:28,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:28,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:28,835 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:06:28,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:28,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:29,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {1674#true} call ULTIMATE.init(); {1674#true} is VALID [2018-11-23 12:06:29,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {1674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1674#true} is VALID [2018-11-23 12:06:29,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {1674#true} assume true; {1674#true} is VALID [2018-11-23 12:06:29,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1674#true} {1674#true} #60#return; {1674#true} is VALID [2018-11-23 12:06:29,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {1674#true} call #t~ret4 := main(); {1674#true} is VALID [2018-11-23 12:06:29,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {1674#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1701#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:29,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {1701#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1677#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {1677#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1678#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1679#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {1679#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1680#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {1680#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1681#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1682#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~0 6)} assume !(~i~0 < 10000); {1675#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {1675#false} ~i~0 := 0; {1675#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:29,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:29,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:29,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:29,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {1675#false} is VALID [2018-11-23 12:06:29,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {1675#false} assume !(~i~0 < 10000); {1675#false} is VALID [2018-11-23 12:06:29,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {1675#false} ~i~0 := 0;~j~0 := 0; {1675#false} is VALID [2018-11-23 12:06:29,293 INFO L273 TraceCheckUtils]: 22: Hoare triple {1675#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {1675#false} is VALID [2018-11-23 12:06:29,293 INFO L256 TraceCheckUtils]: 23: Hoare triple {1675#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1675#false} is VALID [2018-11-23 12:06:29,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {1675#false} ~cond := #in~cond; {1675#false} is VALID [2018-11-23 12:06:29,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {1675#false} assume 0 == ~cond; {1675#false} is VALID [2018-11-23 12:06:29,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {1675#false} assume !false; {1675#false} is VALID [2018-11-23 12:06:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:06:29,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:29,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:06:29,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-23 12:06:29,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:29,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:06:29,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:29,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:06:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:06:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:29,389 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-11-23 12:06:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,813 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2018-11-23 12:06:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:06:29,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-23 12:06:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2018-11-23 12:06:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2018-11-23 12:06:29,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 78 transitions. [2018-11-23 12:06:29,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:29,951 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:06:29,951 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:06:29,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:06:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2018-11-23 12:06:29,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:29,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 33 states. [2018-11-23 12:06:29,976 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 33 states. [2018-11-23 12:06:29,976 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 33 states. [2018-11-23 12:06:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,980 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 12:06:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 12:06:29,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,982 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 54 states. [2018-11-23 12:06:29,982 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 54 states. [2018-11-23 12:06:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,985 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 12:06:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 12:06:29,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:29,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:06:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:06:29,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2018-11-23 12:06:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:29,988 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:06:29,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:06:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:06:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:06:29,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:29,989 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:29,989 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:29,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -411883739, now seen corresponding path program 7 times [2018-11-23 12:06:29,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:29,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:29,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2018-11-23 12:06:30,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2047#true} is VALID [2018-11-23 12:06:30,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-23 12:06:30,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #60#return; {2047#true} is VALID [2018-11-23 12:06:30,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret4 := main(); {2047#true} is VALID [2018-11-23 12:06:30,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {2047#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2049#(= main_~i~0 0)} is VALID [2018-11-23 12:06:30,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {2049#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2050#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {2050#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2051#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {2051#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2052#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {2052#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2053#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {2053#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2054#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {2054#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2055#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {2056#(<= main_~i~0 7)} assume !(~i~0 < 10000); {2048#false} is VALID [2018-11-23 12:06:30,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {2048#false} ~i~0 := 0; {2048#false} is VALID [2018-11-23 12:06:30,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {2048#false} assume !(~i~0 < 10000); {2048#false} is VALID [2018-11-23 12:06:30,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {2048#false} ~i~0 := 0;~j~0 := 0; {2048#false} is VALID [2018-11-23 12:06:30,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {2048#false} is VALID [2018-11-23 12:06:30,195 INFO L256 TraceCheckUtils]: 25: Hoare triple {2048#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2048#false} is VALID [2018-11-23 12:06:30,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2018-11-23 12:06:30,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2018-11-23 12:06:30,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2018-11-23 12:06:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:06:30,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:30,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:30,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2018-11-23 12:06:30,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2047#true} is VALID [2018-11-23 12:06:30,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-23 12:06:30,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #60#return; {2047#true} is VALID [2018-11-23 12:06:30,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret4 := main(); {2047#true} is VALID [2018-11-23 12:06:30,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {2047#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2075#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:30,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {2075#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2050#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {2050#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2051#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {2051#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2052#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {2052#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2053#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {2053#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2054#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {2054#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2055#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {2056#(<= main_~i~0 7)} assume !(~i~0 < 10000); {2048#false} is VALID [2018-11-23 12:06:30,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {2048#false} ~i~0 := 0; {2048#false} is VALID [2018-11-23 12:06:30,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2048#false} is VALID [2018-11-23 12:06:30,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {2048#false} assume !(~i~0 < 10000); {2048#false} is VALID [2018-11-23 12:06:30,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {2048#false} ~i~0 := 0;~j~0 := 0; {2048#false} is VALID [2018-11-23 12:06:30,360 INFO L273 TraceCheckUtils]: 24: Hoare triple {2048#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {2048#false} is VALID [2018-11-23 12:06:30,360 INFO L256 TraceCheckUtils]: 25: Hoare triple {2048#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2048#false} is VALID [2018-11-23 12:06:30,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2018-11-23 12:06:30,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2018-11-23 12:06:30,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2018-11-23 12:06:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:06:30,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:30,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:06:30,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 12:06:30,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:30,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:06:30,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:30,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:06:30,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:06:30,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:30,405 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-11-23 12:06:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,058 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2018-11-23 12:06:31,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:06:31,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 12:06:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 12:06:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 12:06:31,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2018-11-23 12:06:31,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:31,162 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:06:31,162 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:06:31,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:06:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2018-11-23 12:06:31,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:31,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 35 states. [2018-11-23 12:06:31,194 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 35 states. [2018-11-23 12:06:31,194 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 35 states. [2018-11-23 12:06:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,198 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 12:06:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 12:06:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:31,199 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 59 states. [2018-11-23 12:06:31,199 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 59 states. [2018-11-23 12:06:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,202 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 12:06:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 12:06:31,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:31,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:31,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:31,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 12:06:31,205 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2018-11-23 12:06:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:31,205 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 12:06:31,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:06:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 12:06:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:06:31,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:31,206 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:31,207 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:31,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:31,207 INFO L82 PathProgramCache]: Analyzing trace with hash -959578330, now seen corresponding path program 8 times [2018-11-23 12:06:31,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:31,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:31,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:31,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2018-11-23 12:06:31,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2452#true} is VALID [2018-11-23 12:06:31,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2018-11-23 12:06:31,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #60#return; {2452#true} is VALID [2018-11-23 12:06:31,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret4 := main(); {2452#true} is VALID [2018-11-23 12:06:31,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {2452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2454#(= main_~i~0 0)} is VALID [2018-11-23 12:06:31,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {2454#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2455#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {2455#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2456#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {2456#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2457#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {2457#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {2460#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {2461#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {2462#(<= main_~i~0 8)} assume !(~i~0 < 10000); {2453#false} is VALID [2018-11-23 12:06:31,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {2453#false} ~i~0 := 0; {2453#false} is VALID [2018-11-23 12:06:31,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,463 INFO L273 TraceCheckUtils]: 19: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {2453#false} assume !(~i~0 < 10000); {2453#false} is VALID [2018-11-23 12:06:31,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {2453#false} ~i~0 := 0;~j~0 := 0; {2453#false} is VALID [2018-11-23 12:06:31,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {2453#false} is VALID [2018-11-23 12:06:31,465 INFO L256 TraceCheckUtils]: 27: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2453#false} is VALID [2018-11-23 12:06:31,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2018-11-23 12:06:31,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2018-11-23 12:06:31,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2018-11-23 12:06:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:06:31,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:31,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:31,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:31,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:31,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:31,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:31,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2018-11-23 12:06:31,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2452#true} is VALID [2018-11-23 12:06:31,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2018-11-23 12:06:31,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #60#return; {2452#true} is VALID [2018-11-23 12:06:31,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret4 := main(); {2452#true} is VALID [2018-11-23 12:06:31,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {2452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2481#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:31,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {2481#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2455#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {2455#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2456#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {2456#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2457#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {2457#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {2460#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {2461#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {2462#(<= main_~i~0 8)} assume !(~i~0 < 10000); {2453#false} is VALID [2018-11-23 12:06:31,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {2453#false} ~i~0 := 0; {2453#false} is VALID [2018-11-23 12:06:31,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {2453#false} assume !(~i~0 < 10000); {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {2453#false} ~i~0 := 0;~j~0 := 0; {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {2453#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L256 TraceCheckUtils]: 27: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2018-11-23 12:06:31,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2018-11-23 12:06:31,794 INFO L273 TraceCheckUtils]: 30: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2018-11-23 12:06:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:06:31,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:31,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:06:31,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:06:31,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:31,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:06:31,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:31,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:06:31,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:06:31,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:31,841 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-11-23 12:06:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,435 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-23 12:06:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:06:32,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:06:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2018-11-23 12:06:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2018-11-23 12:06:32,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 90 transitions. [2018-11-23 12:06:32,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:32,538 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:06:32,538 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:06:32,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:06:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2018-11-23 12:06:32,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:32,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 37 states. [2018-11-23 12:06:32,573 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 37 states. [2018-11-23 12:06:32,573 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 37 states. [2018-11-23 12:06:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,576 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-23 12:06:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-11-23 12:06:32,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:32,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:32,578 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 64 states. [2018-11-23 12:06:32,578 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 64 states. [2018-11-23 12:06:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,581 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-23 12:06:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-11-23 12:06:32,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:32,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:32,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:32,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:06:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 12:06:32,583 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 31 [2018-11-23 12:06:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:32,584 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 12:06:32,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:06:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 12:06:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:06:32,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:32,585 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:32,585 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:32,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1380204475, now seen corresponding path program 9 times [2018-11-23 12:06:32,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:32,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:32,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:32,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {2889#true} call ULTIMATE.init(); {2889#true} is VALID [2018-11-23 12:06:32,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {2889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2889#true} is VALID [2018-11-23 12:06:32,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {2889#true} assume true; {2889#true} is VALID [2018-11-23 12:06:32,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2889#true} {2889#true} #60#return; {2889#true} is VALID [2018-11-23 12:06:32,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {2889#true} call #t~ret4 := main(); {2889#true} is VALID [2018-11-23 12:06:32,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {2889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2891#(= main_~i~0 0)} is VALID [2018-11-23 12:06:32,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {2891#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:32,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {2892#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:32,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {2893#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:32,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2895#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:32,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {2895#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2896#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:32,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {2896#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2897#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:32,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {2897#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2898#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:32,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {2898#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2899#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:32,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {2899#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2900#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:32,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {2900#(<= main_~i~0 9)} assume !(~i~0 < 10000); {2890#false} is VALID [2018-11-23 12:06:32,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {2890#false} ~i~0 := 0; {2890#false} is VALID [2018-11-23 12:06:32,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2890#false} is VALID [2018-11-23 12:06:32,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {2890#false} assume !(~i~0 < 10000); {2890#false} is VALID [2018-11-23 12:06:32,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {2890#false} ~i~0 := 0;~j~0 := 0; {2890#false} is VALID [2018-11-23 12:06:32,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {2890#false} is VALID [2018-11-23 12:06:32,800 INFO L256 TraceCheckUtils]: 29: Hoare triple {2890#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2890#false} is VALID [2018-11-23 12:06:32,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {2890#false} ~cond := #in~cond; {2890#false} is VALID [2018-11-23 12:06:32,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {2890#false} assume 0 == ~cond; {2890#false} is VALID [2018-11-23 12:06:32,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {2890#false} assume !false; {2890#false} is VALID [2018-11-23 12:06:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:06:32,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:32,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:32,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:33,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:06:33,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:33,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:33,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {2889#true} call ULTIMATE.init(); {2889#true} is VALID [2018-11-23 12:06:33,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {2889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2889#true} is VALID [2018-11-23 12:06:33,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {2889#true} assume true; {2889#true} is VALID [2018-11-23 12:06:33,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2889#true} {2889#true} #60#return; {2889#true} is VALID [2018-11-23 12:06:33,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {2889#true} call #t~ret4 := main(); {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {2889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {2889#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2889#true} is VALID [2018-11-23 12:06:33,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {2889#true} assume !(~i~0 < 10000); {2889#true} is VALID [2018-11-23 12:06:33,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {2889#true} ~i~0 := 0; {2952#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:33,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {2952#(<= main_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2892#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:33,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {2892#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2893#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:33,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {2893#(<= main_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2894#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:33,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {2894#(<= main_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2895#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:33,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {2895#(<= main_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2896#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:33,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {2896#(<= main_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2897#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:33,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {2897#(<= main_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2898#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:33,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {2898#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2899#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:33,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {2899#(<= main_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {2900#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:33,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {2900#(<= main_~i~0 9)} assume !(~i~0 < 10000); {2890#false} is VALID [2018-11-23 12:06:33,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {2890#false} ~i~0 := 0;~j~0 := 0; {2890#false} is VALID [2018-11-23 12:06:33,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {2890#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {2890#false} is VALID [2018-11-23 12:06:33,563 INFO L256 TraceCheckUtils]: 29: Hoare triple {2890#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2890#false} is VALID [2018-11-23 12:06:33,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {2890#false} ~cond := #in~cond; {2890#false} is VALID [2018-11-23 12:06:33,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {2890#false} assume 0 == ~cond; {2890#false} is VALID [2018-11-23 12:06:33,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {2890#false} assume !false; {2890#false} is VALID [2018-11-23 12:06:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:06:33,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:33,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:06:33,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 12:06:33,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:33,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:06:33,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:33,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:06:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:06:33,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:33,643 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 13 states. [2018-11-23 12:06:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:34,151 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-23 12:06:34,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:06:34,151 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 12:06:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-23 12:06:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-23 12:06:34,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2018-11-23 12:06:34,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:34,285 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:06:34,285 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:06:34,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:06:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-11-23 12:06:34,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:34,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 39 states. [2018-11-23 12:06:34,310 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 39 states. [2018-11-23 12:06:34,310 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 39 states. [2018-11-23 12:06:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:34,313 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-23 12:06:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-23 12:06:34,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:34,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:34,314 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 69 states. [2018-11-23 12:06:34,314 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 69 states. [2018-11-23 12:06:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:34,316 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-23 12:06:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-23 12:06:34,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:34,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:34,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:34,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:06:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 12:06:34,318 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2018-11-23 12:06:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:34,318 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 12:06:34,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:06:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 12:06:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:06:34,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:34,319 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:34,320 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:34,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2054257670, now seen corresponding path program 10 times [2018-11-23 12:06:34,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:34,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:34,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:34,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {3358#true} call ULTIMATE.init(); {3358#true} is VALID [2018-11-23 12:06:34,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {3358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3358#true} is VALID [2018-11-23 12:06:34,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {3358#true} assume true; {3358#true} is VALID [2018-11-23 12:06:34,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3358#true} {3358#true} #60#return; {3358#true} is VALID [2018-11-23 12:06:34,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {3358#true} call #t~ret4 := main(); {3358#true} is VALID [2018-11-23 12:06:34,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {3358#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3360#(= main_~i~0 0)} is VALID [2018-11-23 12:06:34,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {3360#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3361#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {3361#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3362#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {3362#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3363#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {3363#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3364#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {3364#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3365#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {3365#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3366#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {3366#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3367#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {3367#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3368#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {3368#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3369#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {3369#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3370#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {3370#(<= main_~i~0 10)} assume !(~i~0 < 10000); {3359#false} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {3359#false} ~i~0 := 0; {3359#false} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {3359#false} assume !(~i~0 < 10000); {3359#false} is VALID [2018-11-23 12:06:34,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {3359#false} ~i~0 := 0;~j~0 := 0; {3359#false} is VALID [2018-11-23 12:06:34,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {3359#false} is VALID [2018-11-23 12:06:34,606 INFO L256 TraceCheckUtils]: 31: Hoare triple {3359#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3359#false} is VALID [2018-11-23 12:06:34,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {3359#false} ~cond := #in~cond; {3359#false} is VALID [2018-11-23 12:06:34,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {3359#false} assume 0 == ~cond; {3359#false} is VALID [2018-11-23 12:06:34,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {3359#false} assume !false; {3359#false} is VALID [2018-11-23 12:06:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:06:34,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:34,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:34,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:34,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:34,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:34,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:34,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {3358#true} call ULTIMATE.init(); {3358#true} is VALID [2018-11-23 12:06:34,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {3358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3358#true} is VALID [2018-11-23 12:06:34,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {3358#true} assume true; {3358#true} is VALID [2018-11-23 12:06:34,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3358#true} {3358#true} #60#return; {3358#true} is VALID [2018-11-23 12:06:34,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {3358#true} call #t~ret4 := main(); {3358#true} is VALID [2018-11-23 12:06:34,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {3358#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3389#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:34,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {3389#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3361#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {3361#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3362#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {3362#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3363#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {3363#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3364#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {3364#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3365#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {3365#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3366#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {3366#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3367#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {3367#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3368#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {3368#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3369#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {3369#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3370#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {3370#(<= main_~i~0 10)} assume !(~i~0 < 10000); {3359#false} is VALID [2018-11-23 12:06:34,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {3359#false} ~i~0 := 0; {3359#false} is VALID [2018-11-23 12:06:34,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3359#false} is VALID [2018-11-23 12:06:34,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {3359#false} assume !(~i~0 < 10000); {3359#false} is VALID [2018-11-23 12:06:34,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {3359#false} ~i~0 := 0;~j~0 := 0; {3359#false} is VALID [2018-11-23 12:06:34,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {3359#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {3359#false} is VALID [2018-11-23 12:06:34,819 INFO L256 TraceCheckUtils]: 31: Hoare triple {3359#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3359#false} is VALID [2018-11-23 12:06:34,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {3359#false} ~cond := #in~cond; {3359#false} is VALID [2018-11-23 12:06:34,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {3359#false} assume 0 == ~cond; {3359#false} is VALID [2018-11-23 12:06:34,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {3359#false} assume !false; {3359#false} is VALID [2018-11-23 12:06:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:06:34,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:34,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:06:34,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 12:06:34,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:34,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:06:34,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:34,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:06:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:06:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:34,867 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 14 states. [2018-11-23 12:06:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,538 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2018-11-23 12:06:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:06:35,538 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 12:06:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2018-11-23 12:06:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2018-11-23 12:06:35,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 102 transitions. [2018-11-23 12:06:35,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:35,711 INFO L225 Difference]: With dead ends: 96 [2018-11-23 12:06:35,712 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:06:35,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:06:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2018-11-23 12:06:35,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:35,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 41 states. [2018-11-23 12:06:35,850 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 41 states. [2018-11-23 12:06:35,850 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 41 states. [2018-11-23 12:06:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,853 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-23 12:06:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2018-11-23 12:06:35,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:35,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:35,854 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 74 states. [2018-11-23 12:06:35,854 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 74 states. [2018-11-23 12:06:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,856 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-23 12:06:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2018-11-23 12:06:35,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:35,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:35,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:35,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:06:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 12:06:35,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2018-11-23 12:06:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 12:06:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:06:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 12:06:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:06:35,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:35,860 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:35,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:35,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1290555749, now seen corresponding path program 11 times [2018-11-23 12:06:35,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:35,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:36,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {3859#true} call ULTIMATE.init(); {3859#true} is VALID [2018-11-23 12:06:36,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {3859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3859#true} is VALID [2018-11-23 12:06:36,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {3859#true} assume true; {3859#true} is VALID [2018-11-23 12:06:36,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3859#true} {3859#true} #60#return; {3859#true} is VALID [2018-11-23 12:06:36,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {3859#true} call #t~ret4 := main(); {3859#true} is VALID [2018-11-23 12:06:36,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {3859#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3861#(= main_~i~0 0)} is VALID [2018-11-23 12:06:36,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {3861#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3862#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:36,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {3862#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3863#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:36,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {3863#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3864#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:36,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {3864#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3865#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:36,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {3865#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3866#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:36,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {3866#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3867#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:36,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {3867#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3868#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:36,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {3868#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3869#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:36,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {3869#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3870#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:36,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {3870#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3871#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:36,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {3871#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3872#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:36,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {3872#(<= main_~i~0 11)} assume !(~i~0 < 10000); {3860#false} is VALID [2018-11-23 12:06:36,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {3860#false} ~i~0 := 0; {3860#false} is VALID [2018-11-23 12:06:36,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:36,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {3860#false} assume !(~i~0 < 10000); {3860#false} is VALID [2018-11-23 12:06:36,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {3860#false} ~i~0 := 0;~j~0 := 0; {3860#false} is VALID [2018-11-23 12:06:36,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {3860#false} is VALID [2018-11-23 12:06:36,562 INFO L256 TraceCheckUtils]: 33: Hoare triple {3860#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3860#false} is VALID [2018-11-23 12:06:36,562 INFO L273 TraceCheckUtils]: 34: Hoare triple {3860#false} ~cond := #in~cond; {3860#false} is VALID [2018-11-23 12:06:36,562 INFO L273 TraceCheckUtils]: 35: Hoare triple {3860#false} assume 0 == ~cond; {3860#false} is VALID [2018-11-23 12:06:36,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2018-11-23 12:06:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:06:36,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:36,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:36,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:38,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:06:38,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:38,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:38,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {3859#true} call ULTIMATE.init(); {3859#true} is VALID [2018-11-23 12:06:38,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {3859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3859#true} is VALID [2018-11-23 12:06:38,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {3859#true} assume true; {3859#true} is VALID [2018-11-23 12:06:38,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3859#true} {3859#true} #60#return; {3859#true} is VALID [2018-11-23 12:06:38,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {3859#true} call #t~ret4 := main(); {3859#true} is VALID [2018-11-23 12:06:38,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {3859#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3891#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {3891#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3862#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {3862#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3863#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {3863#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3864#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {3864#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3865#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {3865#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3866#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {3866#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3867#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {3867#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3868#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {3868#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3869#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {3869#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3870#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {3870#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3871#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {3871#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3872#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {3872#(<= main_~i~0 11)} assume !(~i~0 < 10000); {3860#false} is VALID [2018-11-23 12:06:38,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {3860#false} ~i~0 := 0; {3860#false} is VALID [2018-11-23 12:06:38,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {3860#false} is VALID [2018-11-23 12:06:38,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {3860#false} assume !(~i~0 < 10000); {3860#false} is VALID [2018-11-23 12:06:38,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {3860#false} ~i~0 := 0;~j~0 := 0; {3860#false} is VALID [2018-11-23 12:06:38,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {3860#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {3860#false} is VALID [2018-11-23 12:06:38,965 INFO L256 TraceCheckUtils]: 33: Hoare triple {3860#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3860#false} is VALID [2018-11-23 12:06:38,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {3860#false} ~cond := #in~cond; {3860#false} is VALID [2018-11-23 12:06:38,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {3860#false} assume 0 == ~cond; {3860#false} is VALID [2018-11-23 12:06:38,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2018-11-23 12:06:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:06:38,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:38,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:06:38,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 12:06:38,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:38,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:06:39,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:39,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:06:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:06:39,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:39,013 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2018-11-23 12:06:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,626 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-23 12:06:39,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:06:39,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 12:06:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2018-11-23 12:06:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2018-11-23 12:06:39,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 108 transitions. [2018-11-23 12:06:39,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:39,765 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:06:39,765 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:06:39,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:06:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 43. [2018-11-23 12:06:39,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:39,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 43 states. [2018-11-23 12:06:39,797 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 43 states. [2018-11-23 12:06:39,798 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 43 states. [2018-11-23 12:06:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,801 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-23 12:06:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-11-23 12:06:39,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,802 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 79 states. [2018-11-23 12:06:39,802 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 79 states. [2018-11-23 12:06:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,805 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-23 12:06:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-11-23 12:06:39,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:39,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 12:06:39,807 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 37 [2018-11-23 12:06:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:39,807 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 12:06:39,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:06:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 12:06:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:06:39,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:39,808 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:39,808 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:39,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1738342170, now seen corresponding path program 12 times [2018-11-23 12:06:39,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:39,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:39,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:39,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:40,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {4392#true} call ULTIMATE.init(); {4392#true} is VALID [2018-11-23 12:06:40,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {4392#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4392#true} is VALID [2018-11-23 12:06:40,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {4392#true} assume true; {4392#true} is VALID [2018-11-23 12:06:40,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4392#true} {4392#true} #60#return; {4392#true} is VALID [2018-11-23 12:06:40,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {4392#true} call #t~ret4 := main(); {4392#true} is VALID [2018-11-23 12:06:40,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {4392#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4394#(= main_~i~0 0)} is VALID [2018-11-23 12:06:40,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {4394#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4395#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:40,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {4395#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4396#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:40,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {4396#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4397#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:40,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {4397#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4398#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:40,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4399#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:40,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {4399#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4400#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:40,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {4400#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4401#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:40,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {4401#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4402#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:40,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {4402#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4403#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:40,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {4403#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4404#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:40,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {4404#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4405#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:40,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {4405#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4406#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:40,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {4406#(<= main_~i~0 12)} assume !(~i~0 < 10000); {4393#false} is VALID [2018-11-23 12:06:40,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {4393#false} ~i~0 := 0; {4393#false} is VALID [2018-11-23 12:06:40,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,264 INFO L273 TraceCheckUtils]: 28: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 30: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 31: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 32: Hoare triple {4393#false} assume !(~i~0 < 10000); {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {4393#false} ~i~0 := 0;~j~0 := 0; {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L256 TraceCheckUtils]: 35: Hoare triple {4393#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4393#false} is VALID [2018-11-23 12:06:40,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {4393#false} ~cond := #in~cond; {4393#false} is VALID [2018-11-23 12:06:40,266 INFO L273 TraceCheckUtils]: 37: Hoare triple {4393#false} assume 0 == ~cond; {4393#false} is VALID [2018-11-23 12:06:40,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {4393#false} assume !false; {4393#false} is VALID [2018-11-23 12:06:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:06:40,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:40,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:40,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:41,057 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:06:41,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:41,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:41,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {4392#true} call ULTIMATE.init(); {4392#true} is VALID [2018-11-23 12:06:41,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {4392#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4392#true} is VALID [2018-11-23 12:06:41,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {4392#true} assume true; {4392#true} is VALID [2018-11-23 12:06:41,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4392#true} {4392#true} #60#return; {4392#true} is VALID [2018-11-23 12:06:41,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {4392#true} call #t~ret4 := main(); {4392#true} is VALID [2018-11-23 12:06:41,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {4392#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4392#true} is VALID [2018-11-23 12:06:41,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {4392#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4392#true} is VALID [2018-11-23 12:06:41,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {4392#true} assume !(~i~0 < 10000); {4392#true} is VALID [2018-11-23 12:06:41,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {4392#true} ~i~0 := 0; {4467#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:41,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {4467#(<= main_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4395#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {4395#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4396#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {4396#(<= main_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4397#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {4397#(<= main_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4398#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {4398#(<= main_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4399#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {4399#(<= main_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4400#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {4400#(<= main_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4401#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {4401#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4402#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {4402#(<= main_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4403#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {4403#(<= main_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4404#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {4404#(<= main_~i~0 10)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4405#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~0 11)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4406#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {4406#(<= main_~i~0 12)} assume !(~i~0 < 10000); {4393#false} is VALID [2018-11-23 12:06:41,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {4393#false} ~i~0 := 0;~j~0 := 0; {4393#false} is VALID [2018-11-23 12:06:41,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {4393#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {4393#false} is VALID [2018-11-23 12:06:41,228 INFO L256 TraceCheckUtils]: 35: Hoare triple {4393#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4393#false} is VALID [2018-11-23 12:06:41,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {4393#false} ~cond := #in~cond; {4393#false} is VALID [2018-11-23 12:06:41,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {4393#false} assume 0 == ~cond; {4393#false} is VALID [2018-11-23 12:06:41,229 INFO L273 TraceCheckUtils]: 38: Hoare triple {4393#false} assume !false; {4393#false} is VALID [2018-11-23 12:06:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:06:41,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:41,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:06:41,251 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 12:06:41,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:41,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:06:41,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:41,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:06:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:06:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:06:41,304 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 16 states. [2018-11-23 12:06:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:41,954 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2018-11-23 12:06:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:06:41,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 12:06:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-23 12:06:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-23 12:06:41,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 114 transitions. [2018-11-23 12:06:42,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:42,130 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:06:42,130 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:06:42,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:06:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:06:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 45. [2018-11-23 12:06:42,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:42,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 45 states. [2018-11-23 12:06:42,692 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 45 states. [2018-11-23 12:06:42,692 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 45 states. [2018-11-23 12:06:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:42,695 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2018-11-23 12:06:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2018-11-23 12:06:42,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:42,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:42,696 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 84 states. [2018-11-23 12:06:42,697 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 84 states. [2018-11-23 12:06:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:42,700 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2018-11-23 12:06:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2018-11-23 12:06:42,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:42,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:42,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:42,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:06:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-23 12:06:42,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 39 [2018-11-23 12:06:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:42,702 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-23 12:06:42,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:06:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 12:06:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:06:42,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:42,703 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:42,704 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:42,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1074190981, now seen corresponding path program 13 times [2018-11-23 12:06:42,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:42,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:43,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {4957#true} call ULTIMATE.init(); {4957#true} is VALID [2018-11-23 12:06:43,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {4957#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4957#true} is VALID [2018-11-23 12:06:43,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {4957#true} assume true; {4957#true} is VALID [2018-11-23 12:06:43,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4957#true} {4957#true} #60#return; {4957#true} is VALID [2018-11-23 12:06:43,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {4957#true} call #t~ret4 := main(); {4957#true} is VALID [2018-11-23 12:06:43,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {4957#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4959#(= main_~i~0 0)} is VALID [2018-11-23 12:06:43,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {4959#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4960#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:43,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {4960#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4961#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:43,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {4961#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4962#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:43,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {4962#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4963#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:43,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {4963#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4964#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:43,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {4964#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4965#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:43,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {4965#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4966#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:43,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {4966#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4967#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:43,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {4967#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4968#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:43,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {4968#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4969#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:43,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {4969#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4970#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:43,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {4970#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4971#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:43,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {4971#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4972#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:43,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {4972#(<= main_~i~0 13)} assume !(~i~0 < 10000); {4958#false} is VALID [2018-11-23 12:06:43,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {4958#false} ~i~0 := 0; {4958#false} is VALID [2018-11-23 12:06:43,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,302 INFO L273 TraceCheckUtils]: 24: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,303 INFO L273 TraceCheckUtils]: 29: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 32: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {4958#false} assume !(~i~0 < 10000); {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {4958#false} ~i~0 := 0;~j~0 := 0; {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L256 TraceCheckUtils]: 37: Hoare triple {4958#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 38: Hoare triple {4958#false} ~cond := #in~cond; {4958#false} is VALID [2018-11-23 12:06:43,304 INFO L273 TraceCheckUtils]: 39: Hoare triple {4958#false} assume 0 == ~cond; {4958#false} is VALID [2018-11-23 12:06:43,305 INFO L273 TraceCheckUtils]: 40: Hoare triple {4958#false} assume !false; {4958#false} is VALID [2018-11-23 12:06:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 12:06:43,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:43,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:43,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:43,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:43,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {4957#true} call ULTIMATE.init(); {4957#true} is VALID [2018-11-23 12:06:43,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {4957#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4957#true} is VALID [2018-11-23 12:06:43,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {4957#true} assume true; {4957#true} is VALID [2018-11-23 12:06:43,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4957#true} {4957#true} #60#return; {4957#true} is VALID [2018-11-23 12:06:43,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {4957#true} call #t~ret4 := main(); {4957#true} is VALID [2018-11-23 12:06:43,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {4957#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4991#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:43,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {4991#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4960#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:43,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {4960#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4961#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:43,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {4961#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4962#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:43,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {4962#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4963#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:43,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {4963#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4964#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:43,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {4964#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4965#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:43,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {4965#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4966#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:43,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {4966#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4967#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:43,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {4967#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4968#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:43,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {4968#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4969#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:43,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {4969#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4970#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:43,482 INFO L273 TraceCheckUtils]: 17: Hoare triple {4970#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4971#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:43,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {4971#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4972#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:43,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {4972#(<= main_~i~0 13)} assume !(~i~0 < 10000); {4958#false} is VALID [2018-11-23 12:06:43,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {4958#false} ~i~0 := 0; {4958#false} is VALID [2018-11-23 12:06:43,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {4958#false} is VALID [2018-11-23 12:06:43,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {4958#false} assume !(~i~0 < 10000); {4958#false} is VALID [2018-11-23 12:06:43,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {4958#false} ~i~0 := 0;~j~0 := 0; {4958#false} is VALID [2018-11-23 12:06:43,487 INFO L273 TraceCheckUtils]: 36: Hoare triple {4958#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {4958#false} is VALID [2018-11-23 12:06:43,488 INFO L256 TraceCheckUtils]: 37: Hoare triple {4958#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4958#false} is VALID [2018-11-23 12:06:43,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {4958#false} ~cond := #in~cond; {4958#false} is VALID [2018-11-23 12:06:43,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {4958#false} assume 0 == ~cond; {4958#false} is VALID [2018-11-23 12:06:43,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {4958#false} assume !false; {4958#false} is VALID [2018-11-23 12:06:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 12:06:43,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:43,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:06:43,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 12:06:43,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:43,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:06:43,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:43,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:06:43,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:06:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:06:43,621 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 17 states. [2018-11-23 12:06:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:44,571 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2018-11-23 12:06:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:06:44,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 12:06:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:06:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2018-11-23 12:06:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:06:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2018-11-23 12:06:44,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 120 transitions. [2018-11-23 12:06:45,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:45,065 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:06:45,065 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:06:45,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:06:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:06:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 47. [2018-11-23 12:06:45,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:45,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 47 states. [2018-11-23 12:06:45,100 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 47 states. [2018-11-23 12:06:45,100 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 47 states. [2018-11-23 12:06:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:45,103 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-23 12:06:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-23 12:06:45,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:45,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:45,106 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 89 states. [2018-11-23 12:06:45,106 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 89 states. [2018-11-23 12:06:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:45,109 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-23 12:06:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-23 12:06:45,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:45,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:45,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:45,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:06:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-23 12:06:45,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 41 [2018-11-23 12:06:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:45,112 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 12:06:45,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:06:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 12:06:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:06:45,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:45,113 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:45,113 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:45,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash 308317638, now seen corresponding path program 14 times [2018-11-23 12:06:45,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:45,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:45,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:45,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:46,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {5554#true} call ULTIMATE.init(); {5554#true} is VALID [2018-11-23 12:06:46,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {5554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5554#true} is VALID [2018-11-23 12:06:46,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {5554#true} assume true; {5554#true} is VALID [2018-11-23 12:06:46,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5554#true} {5554#true} #60#return; {5554#true} is VALID [2018-11-23 12:06:46,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {5554#true} call #t~ret4 := main(); {5554#true} is VALID [2018-11-23 12:06:46,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {5554#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {5556#(= main_~i~0 0)} is VALID [2018-11-23 12:06:46,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {5556#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5557#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:46,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {5557#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5558#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:46,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {5558#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5559#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:46,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {5559#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5560#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:46,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {5560#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5561#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:46,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {5561#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5562#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:46,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {5562#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5563#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:46,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {5563#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5564#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:46,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {5564#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5565#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:46,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {5565#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5566#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:46,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {5566#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5567#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:46,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {5567#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5568#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:46,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {5568#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5569#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:46,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {5569#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5570#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:46,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {5570#(<= main_~i~0 14)} assume !(~i~0 < 10000); {5555#false} is VALID [2018-11-23 12:06:46,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {5555#false} ~i~0 := 0; {5555#false} is VALID [2018-11-23 12:06:46,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {5555#false} assume !(~i~0 < 10000); {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {5555#false} ~i~0 := 0;~j~0 := 0; {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {5555#false} is VALID [2018-11-23 12:06:46,368 INFO L256 TraceCheckUtils]: 39: Hoare triple {5555#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5555#false} is VALID [2018-11-23 12:06:46,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {5555#false} ~cond := #in~cond; {5555#false} is VALID [2018-11-23 12:06:46,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {5555#false} assume 0 == ~cond; {5555#false} is VALID [2018-11-23 12:06:46,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {5555#false} assume !false; {5555#false} is VALID [2018-11-23 12:06:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:06:46,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:46,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:46,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:46,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:46,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:46,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:46,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {5554#true} call ULTIMATE.init(); {5554#true} is VALID [2018-11-23 12:06:46,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {5554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5554#true} is VALID [2018-11-23 12:06:46,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {5554#true} assume true; {5554#true} is VALID [2018-11-23 12:06:46,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5554#true} {5554#true} #60#return; {5554#true} is VALID [2018-11-23 12:06:46,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {5554#true} call #t~ret4 := main(); {5554#true} is VALID [2018-11-23 12:06:46,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {5554#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {5589#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:46,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {5589#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5557#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:46,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {5557#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5558#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:46,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {5558#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5559#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:46,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {5559#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5560#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:46,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {5560#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5561#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:46,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {5561#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5562#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:46,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {5562#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5563#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:46,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {5563#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5564#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:46,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {5564#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5565#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:46,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {5565#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5566#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:46,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {5566#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5567#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:46,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {5567#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5568#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:46,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {5568#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5569#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:46,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {5569#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5570#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:46,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {5570#(<= main_~i~0 14)} assume !(~i~0 < 10000); {5555#false} is VALID [2018-11-23 12:06:46,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {5555#false} ~i~0 := 0; {5555#false} is VALID [2018-11-23 12:06:46,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {5555#false} is VALID [2018-11-23 12:06:46,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {5555#false} assume !(~i~0 < 10000); {5555#false} is VALID [2018-11-23 12:06:46,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {5555#false} ~i~0 := 0;~j~0 := 0; {5555#false} is VALID [2018-11-23 12:06:46,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {5555#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {5555#false} is VALID [2018-11-23 12:06:46,552 INFO L256 TraceCheckUtils]: 39: Hoare triple {5555#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5555#false} is VALID [2018-11-23 12:06:46,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {5555#false} ~cond := #in~cond; {5555#false} is VALID [2018-11-23 12:06:46,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {5555#false} assume 0 == ~cond; {5555#false} is VALID [2018-11-23 12:06:46,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {5555#false} assume !false; {5555#false} is VALID [2018-11-23 12:06:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:06:46,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:46,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:06:46,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 12:06:46,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:46,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:06:46,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:46,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:06:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:06:46,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:06:46,605 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 18 states. [2018-11-23 12:06:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,504 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-23 12:06:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:06:47,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 12:06:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:06:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 126 transitions. [2018-11-23 12:06:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:06:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 126 transitions. [2018-11-23 12:06:47,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 126 transitions. [2018-11-23 12:06:48,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:48,005 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:06:48,005 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:06:48,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:06:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:06:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 49. [2018-11-23 12:06:48,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:48,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 49 states. [2018-11-23 12:06:48,039 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 49 states. [2018-11-23 12:06:48,039 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 49 states. [2018-11-23 12:06:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,043 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2018-11-23 12:06:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2018-11-23 12:06:48,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:48,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:48,044 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 94 states. [2018-11-23 12:06:48,044 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 94 states. [2018-11-23 12:06:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,047 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2018-11-23 12:06:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2018-11-23 12:06:48,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:48,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:48,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:48,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:06:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-23 12:06:48,049 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 43 [2018-11-23 12:06:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:48,050 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-23 12:06:48,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:06:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-23 12:06:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:06:48,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:48,051 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:48,051 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:48,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1181918299, now seen corresponding path program 15 times [2018-11-23 12:06:48,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:48,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:48,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:48,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:48,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {6183#true} call ULTIMATE.init(); {6183#true} is VALID [2018-11-23 12:06:48,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {6183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6183#true} is VALID [2018-11-23 12:06:48,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {6183#true} assume true; {6183#true} is VALID [2018-11-23 12:06:48,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6183#true} {6183#true} #60#return; {6183#true} is VALID [2018-11-23 12:06:48,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {6183#true} call #t~ret4 := main(); {6183#true} is VALID [2018-11-23 12:06:48,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {6183#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {6185#(= main_~i~0 0)} is VALID [2018-11-23 12:06:48,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {6185#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {6186#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6187#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {6187#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6188#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {6188#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6189#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {6189#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6190#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {6190#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6191#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {6191#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6192#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {6192#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6193#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {6193#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6194#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {6194#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6195#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {6195#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6196#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {6196#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6197#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {6197#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6198#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {6198#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6199#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {6199#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6200#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {6200#(<= main_~i~0 15)} assume !(~i~0 < 10000); {6184#false} is VALID [2018-11-23 12:06:48,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {6184#false} ~i~0 := 0; {6184#false} is VALID [2018-11-23 12:06:48,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 35: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {6184#false} assume !(~i~0 < 10000); {6184#false} is VALID [2018-11-23 12:06:48,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {6184#false} ~i~0 := 0;~j~0 := 0; {6184#false} is VALID [2018-11-23 12:06:48,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {6184#false} is VALID [2018-11-23 12:06:48,413 INFO L256 TraceCheckUtils]: 41: Hoare triple {6184#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6184#false} is VALID [2018-11-23 12:06:48,413 INFO L273 TraceCheckUtils]: 42: Hoare triple {6184#false} ~cond := #in~cond; {6184#false} is VALID [2018-11-23 12:06:48,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {6184#false} assume 0 == ~cond; {6184#false} is VALID [2018-11-23 12:06:48,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {6184#false} assume !false; {6184#false} is VALID [2018-11-23 12:06:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:06:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:48,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:58,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:06:58,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:58,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:58,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {6183#true} call ULTIMATE.init(); {6183#true} is VALID [2018-11-23 12:06:58,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {6183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6183#true} is VALID [2018-11-23 12:06:58,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {6183#true} assume true; {6183#true} is VALID [2018-11-23 12:06:58,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6183#true} {6183#true} #60#return; {6183#true} is VALID [2018-11-23 12:06:58,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {6183#true} call #t~ret4 := main(); {6183#true} is VALID [2018-11-23 12:06:58,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {6183#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {6219#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:58,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {6219#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {6186#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6187#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {6187#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6188#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {6188#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6189#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {6189#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6190#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {6190#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6191#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {6191#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6192#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {6192#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6193#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {6193#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6194#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {6194#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6195#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {6195#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6196#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {6196#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6197#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {6197#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6198#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {6198#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6199#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {6199#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6200#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {6200#(<= main_~i~0 15)} assume !(~i~0 < 10000); {6184#false} is VALID [2018-11-23 12:06:58,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {6184#false} ~i~0 := 0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 36: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6184#false} is VALID [2018-11-23 12:06:58,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {6184#false} assume !(~i~0 < 10000); {6184#false} is VALID [2018-11-23 12:06:58,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {6184#false} ~i~0 := 0;~j~0 := 0; {6184#false} is VALID [2018-11-23 12:06:58,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {6184#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {6184#false} is VALID [2018-11-23 12:06:58,800 INFO L256 TraceCheckUtils]: 41: Hoare triple {6184#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6184#false} is VALID [2018-11-23 12:06:58,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {6184#false} ~cond := #in~cond; {6184#false} is VALID [2018-11-23 12:06:58,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {6184#false} assume 0 == ~cond; {6184#false} is VALID [2018-11-23 12:06:58,800 INFO L273 TraceCheckUtils]: 44: Hoare triple {6184#false} assume !false; {6184#false} is VALID [2018-11-23 12:06:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:06:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:06:58,824 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 12:06:58,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:58,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:06:58,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:58,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:06:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:06:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:06:58,857 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2018-11-23 12:06:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:59,826 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2018-11-23 12:06:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:06:59,826 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 12:06:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 132 transitions. [2018-11-23 12:06:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 132 transitions. [2018-11-23 12:06:59,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 132 transitions. [2018-11-23 12:07:00,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:00,006 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:07:00,007 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:07:00,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:07:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:07:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2018-11-23 12:07:00,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:00,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 51 states. [2018-11-23 12:07:00,048 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 51 states. [2018-11-23 12:07:00,048 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 51 states. [2018-11-23 12:07:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:00,052 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2018-11-23 12:07:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2018-11-23 12:07:00,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:00,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:00,053 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 99 states. [2018-11-23 12:07:00,053 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 99 states. [2018-11-23 12:07:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:00,056 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2018-11-23 12:07:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2018-11-23 12:07:00,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:00,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:00,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:00,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:07:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-23 12:07:00,058 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 45 [2018-11-23 12:07:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:00,059 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-23 12:07:00,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:07:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 12:07:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:07:00,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:00,060 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:00,060 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:00,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash -760733018, now seen corresponding path program 16 times [2018-11-23 12:07:00,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:00,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:00,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {6844#true} call ULTIMATE.init(); {6844#true} is VALID [2018-11-23 12:07:00,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {6844#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6844#true} is VALID [2018-11-23 12:07:00,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {6844#true} assume true; {6844#true} is VALID [2018-11-23 12:07:00,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6844#true} {6844#true} #60#return; {6844#true} is VALID [2018-11-23 12:07:00,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {6844#true} call #t~ret4 := main(); {6844#true} is VALID [2018-11-23 12:07:00,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {6844#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {6846#(= main_~i~0 0)} is VALID [2018-11-23 12:07:00,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {6846#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6847#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:00,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {6847#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6848#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:00,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {6848#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6849#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:00,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {6849#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6850#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:00,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {6850#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6851#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:00,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {6851#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6852#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:00,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {6852#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6853#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:00,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {6853#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6854#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:00,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {6854#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6855#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:00,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {6855#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6856#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:00,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {6856#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6857#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:00,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {6857#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6858#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:00,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {6858#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6859#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:00,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {6859#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6860#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:00,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {6860#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6861#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:00,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {6861#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6862#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:00,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {6862#(<= main_~i~0 16)} assume !(~i~0 < 10000); {6845#false} is VALID [2018-11-23 12:07:00,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {6845#false} ~i~0 := 0; {6845#false} is VALID [2018-11-23 12:07:00,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,806 INFO L273 TraceCheckUtils]: 35: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 37: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {6845#false} assume !(~i~0 < 10000); {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 41: Hoare triple {6845#false} ~i~0 := 0;~j~0 := 0; {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L256 TraceCheckUtils]: 43: Hoare triple {6845#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {6845#false} ~cond := #in~cond; {6845#false} is VALID [2018-11-23 12:07:00,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {6845#false} assume 0 == ~cond; {6845#false} is VALID [2018-11-23 12:07:00,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {6845#false} assume !false; {6845#false} is VALID [2018-11-23 12:07:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 12:07:00,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:00,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:00,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:00,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:00,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:00,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:01,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {6844#true} call ULTIMATE.init(); {6844#true} is VALID [2018-11-23 12:07:01,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {6844#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6844#true} is VALID [2018-11-23 12:07:01,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {6844#true} assume true; {6844#true} is VALID [2018-11-23 12:07:01,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6844#true} {6844#true} #60#return; {6844#true} is VALID [2018-11-23 12:07:01,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {6844#true} call #t~ret4 := main(); {6844#true} is VALID [2018-11-23 12:07:01,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {6844#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {6881#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:01,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {6881#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6847#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:01,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {6847#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6848#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:01,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {6848#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6849#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:01,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {6849#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6850#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:01,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {6850#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6851#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:01,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {6851#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6852#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:01,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {6852#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6853#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:01,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {6853#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6854#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:01,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {6854#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6855#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:01,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {6855#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6856#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:01,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {6856#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6857#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:01,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {6857#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6858#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:01,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {6858#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6859#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:01,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {6859#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6860#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:01,042 INFO L273 TraceCheckUtils]: 20: Hoare triple {6860#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6861#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:01,043 INFO L273 TraceCheckUtils]: 21: Hoare triple {6861#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6862#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:01,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {6862#(<= main_~i~0 16)} assume !(~i~0 < 10000); {6845#false} is VALID [2018-11-23 12:07:01,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {6845#false} ~i~0 := 0; {6845#false} is VALID [2018-11-23 12:07:01,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,046 INFO L273 TraceCheckUtils]: 33: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,046 INFO L273 TraceCheckUtils]: 34: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 37: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 38: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {6845#false} assume !(~i~0 < 10000); {6845#false} is VALID [2018-11-23 12:07:01,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {6845#false} ~i~0 := 0;~j~0 := 0; {6845#false} is VALID [2018-11-23 12:07:01,048 INFO L273 TraceCheckUtils]: 42: Hoare triple {6845#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {6845#false} is VALID [2018-11-23 12:07:01,048 INFO L256 TraceCheckUtils]: 43: Hoare triple {6845#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6845#false} is VALID [2018-11-23 12:07:01,048 INFO L273 TraceCheckUtils]: 44: Hoare triple {6845#false} ~cond := #in~cond; {6845#false} is VALID [2018-11-23 12:07:01,048 INFO L273 TraceCheckUtils]: 45: Hoare triple {6845#false} assume 0 == ~cond; {6845#false} is VALID [2018-11-23 12:07:01,048 INFO L273 TraceCheckUtils]: 46: Hoare triple {6845#false} assume !false; {6845#false} is VALID [2018-11-23 12:07:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 12:07:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:07:01,069 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 12:07:01,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:01,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:07:01,094 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:07:01,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:07:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:07:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:07:01,096 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 20 states. [2018-11-23 12:07:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:02,177 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-11-23 12:07:02,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:07:02,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 12:07:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:07:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 138 transitions. [2018-11-23 12:07:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:07:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 138 transitions. [2018-11-23 12:07:02,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 138 transitions. [2018-11-23 12:07:02,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:02,334 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:07:02,335 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:07:02,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:07:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:07:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 53. [2018-11-23 12:07:02,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:02,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 53 states. [2018-11-23 12:07:02,369 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 53 states. [2018-11-23 12:07:02,369 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 53 states. [2018-11-23 12:07:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:02,372 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2018-11-23 12:07:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2018-11-23 12:07:02,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:02,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:02,373 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 104 states. [2018-11-23 12:07:02,373 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 104 states. [2018-11-23 12:07:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:02,376 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2018-11-23 12:07:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2018-11-23 12:07:02,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:02,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:02,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:02,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:07:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-23 12:07:02,378 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2018-11-23 12:07:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:02,378 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 12:07:02,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:07:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 12:07:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:07:02,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:02,379 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:02,380 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:02,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1014901563, now seen corresponding path program 17 times [2018-11-23 12:07:02,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:02,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:02,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {7537#true} call ULTIMATE.init(); {7537#true} is VALID [2018-11-23 12:07:02,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {7537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7537#true} is VALID [2018-11-23 12:07:02,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {7537#true} assume true; {7537#true} is VALID [2018-11-23 12:07:02,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7537#true} {7537#true} #60#return; {7537#true} is VALID [2018-11-23 12:07:02,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {7537#true} call #t~ret4 := main(); {7537#true} is VALID [2018-11-23 12:07:02,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {7537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {7539#(= main_~i~0 0)} is VALID [2018-11-23 12:07:02,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {7539#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7540#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {7540#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7541#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {7541#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7542#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {7542#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7543#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {7543#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7544#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {7544#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7545#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {7545#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7546#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {7546#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7547#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {7547#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7548#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {7548#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7549#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {7549#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7550#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {7550#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7551#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {7551#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7552#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {7552#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7553#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {7553#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7554#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {7554#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7555#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {7555#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7556#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(<= main_~i~0 17)} assume !(~i~0 < 10000); {7538#false} is VALID [2018-11-23 12:07:02,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {7538#false} ~i~0 := 0; {7538#false} is VALID [2018-11-23 12:07:02,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 34: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {7538#false} assume !(~i~0 < 10000); {7538#false} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {7538#false} ~i~0 := 0;~j~0 := 0; {7538#false} is VALID [2018-11-23 12:07:02,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {7538#false} is VALID [2018-11-23 12:07:02,836 INFO L256 TraceCheckUtils]: 45: Hoare triple {7538#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7538#false} is VALID [2018-11-23 12:07:02,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {7538#false} ~cond := #in~cond; {7538#false} is VALID [2018-11-23 12:07:02,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {7538#false} assume 0 == ~cond; {7538#false} is VALID [2018-11-23 12:07:02,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {7538#false} assume !false; {7538#false} is VALID [2018-11-23 12:07:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 12:07:02,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:02,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:02,847 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:21,774 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:07:21,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:21,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:22,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {7537#true} call ULTIMATE.init(); {7537#true} is VALID [2018-11-23 12:07:22,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {7537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7537#true} is VALID [2018-11-23 12:07:22,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {7537#true} assume true; {7537#true} is VALID [2018-11-23 12:07:22,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7537#true} {7537#true} #60#return; {7537#true} is VALID [2018-11-23 12:07:22,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {7537#true} call #t~ret4 := main(); {7537#true} is VALID [2018-11-23 12:07:22,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {7537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {7575#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:22,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {7575#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7540#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:22,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {7540#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7541#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:22,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {7541#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7542#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:22,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {7542#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7543#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:22,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {7543#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7544#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:22,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {7544#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7545#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:22,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {7545#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7546#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:22,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {7546#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7547#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:22,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {7547#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7548#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:22,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {7548#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7549#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:22,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {7549#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7550#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:22,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {7550#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7551#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:22,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {7551#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7552#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:22,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {7552#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7553#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:22,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {7553#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7554#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:22,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {7554#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7555#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:22,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {7555#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7556#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:22,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(<= main_~i~0 17)} assume !(~i~0 < 10000); {7538#false} is VALID [2018-11-23 12:07:22,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {7538#false} ~i~0 := 0; {7538#false} is VALID [2018-11-23 12:07:22,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,070 INFO L273 TraceCheckUtils]: 34: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 39: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {7538#false} assume !(~i~0 < 10000); {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {7538#false} ~i~0 := 0;~j~0 := 0; {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {7538#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L256 TraceCheckUtils]: 45: Hoare triple {7538#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {7538#false} ~cond := #in~cond; {7538#false} is VALID [2018-11-23 12:07:22,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {7538#false} assume 0 == ~cond; {7538#false} is VALID [2018-11-23 12:07:22,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {7538#false} assume !false; {7538#false} is VALID [2018-11-23 12:07:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 12:07:22,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:22,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:07:22,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-23 12:07:22,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:22,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:07:22,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:22,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:07:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:07:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:07:22,126 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2018-11-23 12:07:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,430 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2018-11-23 12:07:23,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:07:23,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-23 12:07:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:07:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 144 transitions. [2018-11-23 12:07:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:07:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 144 transitions. [2018-11-23 12:07:23,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 144 transitions. [2018-11-23 12:07:23,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:23,606 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:07:23,607 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:07:23,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:07:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:07:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2018-11-23 12:07:23,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:23,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 55 states. [2018-11-23 12:07:23,650 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 55 states. [2018-11-23 12:07:23,651 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 55 states. [2018-11-23 12:07:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,654 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-11-23 12:07:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2018-11-23 12:07:23,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:23,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:23,655 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 109 states. [2018-11-23 12:07:23,655 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 109 states. [2018-11-23 12:07:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,658 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-11-23 12:07:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2018-11-23 12:07:23,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:23,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:23,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:23,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:07:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 12:07:23,661 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 49 [2018-11-23 12:07:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:23,661 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 12:07:23,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:07:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 12:07:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:07:23,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:23,662 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:23,662 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:23,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1678262394, now seen corresponding path program 18 times [2018-11-23 12:07:23,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:23,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:23,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:24,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {8262#true} call ULTIMATE.init(); {8262#true} is VALID [2018-11-23 12:07:24,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {8262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8262#true} is VALID [2018-11-23 12:07:24,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {8262#true} assume true; {8262#true} is VALID [2018-11-23 12:07:24,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8262#true} {8262#true} #60#return; {8262#true} is VALID [2018-11-23 12:07:24,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {8262#true} call #t~ret4 := main(); {8262#true} is VALID [2018-11-23 12:07:24,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {8262#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {8264#(= main_~i~0 0)} is VALID [2018-11-23 12:07:24,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {8264#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8265#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:24,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {8265#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8266#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:24,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {8266#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8267#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:24,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {8267#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8268#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:24,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {8268#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8269#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:24,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {8269#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8270#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:24,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {8270#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8271#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:24,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {8271#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8272#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:24,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {8272#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8273#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:24,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {8273#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8274#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:24,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {8274#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8275#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:24,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {8275#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8276#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:24,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {8276#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8277#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:24,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {8277#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8278#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:24,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {8278#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8279#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:24,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {8279#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8280#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:24,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {8280#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8281#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:24,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {8281#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8282#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:24,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {8282#(<= main_~i~0 18)} assume !(~i~0 < 10000); {8263#false} is VALID [2018-11-23 12:07:24,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {8263#false} ~i~0 := 0; {8263#false} is VALID [2018-11-23 12:07:24,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,923 INFO L273 TraceCheckUtils]: 28: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,925 INFO L273 TraceCheckUtils]: 34: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,926 INFO L273 TraceCheckUtils]: 39: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,926 INFO L273 TraceCheckUtils]: 43: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:24,926 INFO L273 TraceCheckUtils]: 44: Hoare triple {8263#false} assume !(~i~0 < 10000); {8263#false} is VALID [2018-11-23 12:07:24,927 INFO L273 TraceCheckUtils]: 45: Hoare triple {8263#false} ~i~0 := 0;~j~0 := 0; {8263#false} is VALID [2018-11-23 12:07:24,927 INFO L273 TraceCheckUtils]: 46: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {8263#false} is VALID [2018-11-23 12:07:24,927 INFO L256 TraceCheckUtils]: 47: Hoare triple {8263#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8263#false} is VALID [2018-11-23 12:07:24,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {8263#false} ~cond := #in~cond; {8263#false} is VALID [2018-11-23 12:07:24,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {8263#false} assume 0 == ~cond; {8263#false} is VALID [2018-11-23 12:07:24,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {8263#false} assume !false; {8263#false} is VALID [2018-11-23 12:07:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 12:07:24,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:24,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:24,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:33,680 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:07:33,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:33,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:33,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {8262#true} call ULTIMATE.init(); {8262#true} is VALID [2018-11-23 12:07:33,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {8262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8262#true} is VALID [2018-11-23 12:07:33,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {8262#true} assume true; {8262#true} is VALID [2018-11-23 12:07:33,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8262#true} {8262#true} #60#return; {8262#true} is VALID [2018-11-23 12:07:33,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {8262#true} call #t~ret4 := main(); {8262#true} is VALID [2018-11-23 12:07:33,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {8262#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {8301#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:33,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {8301#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8265#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {8265#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8266#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {8266#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8267#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {8267#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8268#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {8268#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8269#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {8269#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8270#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {8270#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8271#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {8271#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8272#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {8272#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8273#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {8273#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8274#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {8274#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8275#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {8275#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8276#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {8276#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8277#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {8277#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8278#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,862 INFO L273 TraceCheckUtils]: 20: Hoare triple {8278#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8279#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {8279#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8280#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {8280#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8281#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {8281#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8282#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {8282#(<= main_~i~0 18)} assume !(~i~0 < 10000); {8263#false} is VALID [2018-11-23 12:07:33,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {8263#false} ~i~0 := 0; {8263#false} is VALID [2018-11-23 12:07:33,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,866 INFO L273 TraceCheckUtils]: 27: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,867 INFO L273 TraceCheckUtils]: 32: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,868 INFO L273 TraceCheckUtils]: 33: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,868 INFO L273 TraceCheckUtils]: 36: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 38: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 39: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 41: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 42: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 43: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {8263#false} is VALID [2018-11-23 12:07:33,869 INFO L273 TraceCheckUtils]: 44: Hoare triple {8263#false} assume !(~i~0 < 10000); {8263#false} is VALID [2018-11-23 12:07:33,870 INFO L273 TraceCheckUtils]: 45: Hoare triple {8263#false} ~i~0 := 0;~j~0 := 0; {8263#false} is VALID [2018-11-23 12:07:33,870 INFO L273 TraceCheckUtils]: 46: Hoare triple {8263#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {8263#false} is VALID [2018-11-23 12:07:33,870 INFO L256 TraceCheckUtils]: 47: Hoare triple {8263#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8263#false} is VALID [2018-11-23 12:07:33,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {8263#false} ~cond := #in~cond; {8263#false} is VALID [2018-11-23 12:07:33,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {8263#false} assume 0 == ~cond; {8263#false} is VALID [2018-11-23 12:07:33,870 INFO L273 TraceCheckUtils]: 50: Hoare triple {8263#false} assume !false; {8263#false} is VALID [2018-11-23 12:07:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 12:07:33,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:33,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:07:33,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 12:07:33,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:33,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:07:33,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:33,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:07:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:07:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:07:33,922 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2018-11-23 12:07:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:35,850 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2018-11-23 12:07:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:07:35,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 12:07:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:07:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2018-11-23 12:07:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:07:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2018-11-23 12:07:35,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 150 transitions. [2018-11-23 12:07:36,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:36,026 INFO L225 Difference]: With dead ends: 144 [2018-11-23 12:07:36,026 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 12:07:36,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:07:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 12:07:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 57. [2018-11-23 12:07:36,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:36,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 57 states. [2018-11-23 12:07:36,086 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 57 states. [2018-11-23 12:07:36,086 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 57 states. [2018-11-23 12:07:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,088 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-11-23 12:07:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2018-11-23 12:07:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:36,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:36,089 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 114 states. [2018-11-23 12:07:36,089 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 114 states. [2018-11-23 12:07:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,092 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-11-23 12:07:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2018-11-23 12:07:36,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:36,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:36,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:36,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:07:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-23 12:07:36,094 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 51 [2018-11-23 12:07:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:36,095 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 12:07:36,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:07:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 12:07:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:07:36,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:36,096 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:36,096 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:36,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1600538085, now seen corresponding path program 19 times [2018-11-23 12:07:36,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:36,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:36,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {9019#true} call ULTIMATE.init(); {9019#true} is VALID [2018-11-23 12:07:36,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {9019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9019#true} is VALID [2018-11-23 12:07:36,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {9019#true} assume true; {9019#true} is VALID [2018-11-23 12:07:36,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9019#true} {9019#true} #60#return; {9019#true} is VALID [2018-11-23 12:07:36,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {9019#true} call #t~ret4 := main(); {9019#true} is VALID [2018-11-23 12:07:36,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {9019#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {9021#(= main_~i~0 0)} is VALID [2018-11-23 12:07:36,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {9021#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9022#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:36,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {9022#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9023#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:36,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {9023#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9024#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:36,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {9024#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9025#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:36,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {9025#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9026#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:36,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {9026#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9027#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:36,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {9027#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9028#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:36,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {9028#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9029#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:36,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {9029#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9030#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:36,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {9030#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9031#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:36,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {9031#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9032#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:36,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {9032#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9033#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:36,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {9033#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9034#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:36,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {9034#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9035#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:36,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {9035#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9036#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:36,815 INFO L273 TraceCheckUtils]: 21: Hoare triple {9036#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9037#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:36,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {9037#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9038#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:36,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {9038#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9039#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:36,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {9039#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9040#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:36,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {9040#(<= main_~i~0 19)} assume !(~i~0 < 10000); {9020#false} is VALID [2018-11-23 12:07:36,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {9020#false} ~i~0 := 0; {9020#false} is VALID [2018-11-23 12:07:36,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,821 INFO L273 TraceCheckUtils]: 34: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,822 INFO L273 TraceCheckUtils]: 39: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,822 INFO L273 TraceCheckUtils]: 40: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,823 INFO L273 TraceCheckUtils]: 42: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,823 INFO L273 TraceCheckUtils]: 43: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:36,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {9020#false} assume !(~i~0 < 10000); {9020#false} is VALID [2018-11-23 12:07:36,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {9020#false} ~i~0 := 0;~j~0 := 0; {9020#false} is VALID [2018-11-23 12:07:36,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {9020#false} is VALID [2018-11-23 12:07:36,824 INFO L256 TraceCheckUtils]: 49: Hoare triple {9020#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9020#false} is VALID [2018-11-23 12:07:36,824 INFO L273 TraceCheckUtils]: 50: Hoare triple {9020#false} ~cond := #in~cond; {9020#false} is VALID [2018-11-23 12:07:36,824 INFO L273 TraceCheckUtils]: 51: Hoare triple {9020#false} assume 0 == ~cond; {9020#false} is VALID [2018-11-23 12:07:36,825 INFO L273 TraceCheckUtils]: 52: Hoare triple {9020#false} assume !false; {9020#false} is VALID [2018-11-23 12:07:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 12:07:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:36,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:36,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:36,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:37,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {9019#true} call ULTIMATE.init(); {9019#true} is VALID [2018-11-23 12:07:37,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {9019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9019#true} is VALID [2018-11-23 12:07:37,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {9019#true} assume true; {9019#true} is VALID [2018-11-23 12:07:37,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9019#true} {9019#true} #60#return; {9019#true} is VALID [2018-11-23 12:07:37,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {9019#true} call #t~ret4 := main(); {9019#true} is VALID [2018-11-23 12:07:37,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {9019#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {9059#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:37,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {9059#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9022#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:37,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {9022#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9023#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:37,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {9023#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9024#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:37,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {9024#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9025#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:37,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {9025#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9026#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:37,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {9026#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9027#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:37,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {9027#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9028#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:37,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {9028#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9029#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:37,106 INFO L273 TraceCheckUtils]: 14: Hoare triple {9029#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9030#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:37,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {9030#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9031#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:37,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {9031#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9032#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:37,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {9032#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9033#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:37,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {9033#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9034#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:37,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {9034#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9035#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:37,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {9035#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9036#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:37,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {9036#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9037#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:37,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {9037#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9038#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:37,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {9038#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9039#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:37,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {9039#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9040#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:37,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {9040#(<= main_~i~0 19)} assume !(~i~0 < 10000); {9020#false} is VALID [2018-11-23 12:07:37,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {9020#false} ~i~0 := 0; {9020#false} is VALID [2018-11-23 12:07:37,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,118 INFO L273 TraceCheckUtils]: 30: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,119 INFO L273 TraceCheckUtils]: 32: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,119 INFO L273 TraceCheckUtils]: 34: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,119 INFO L273 TraceCheckUtils]: 35: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,120 INFO L273 TraceCheckUtils]: 36: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,120 INFO L273 TraceCheckUtils]: 37: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,120 INFO L273 TraceCheckUtils]: 38: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,121 INFO L273 TraceCheckUtils]: 44: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,121 INFO L273 TraceCheckUtils]: 45: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9020#false} is VALID [2018-11-23 12:07:37,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {9020#false} assume !(~i~0 < 10000); {9020#false} is VALID [2018-11-23 12:07:37,122 INFO L273 TraceCheckUtils]: 47: Hoare triple {9020#false} ~i~0 := 0;~j~0 := 0; {9020#false} is VALID [2018-11-23 12:07:37,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {9020#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {9020#false} is VALID [2018-11-23 12:07:37,122 INFO L256 TraceCheckUtils]: 49: Hoare triple {9020#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9020#false} is VALID [2018-11-23 12:07:37,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {9020#false} ~cond := #in~cond; {9020#false} is VALID [2018-11-23 12:07:37,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {9020#false} assume 0 == ~cond; {9020#false} is VALID [2018-11-23 12:07:37,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {9020#false} assume !false; {9020#false} is VALID [2018-11-23 12:07:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 12:07:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:37,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:07:37,148 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 12:07:37,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:37,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:07:37,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:37,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:07:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:07:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:07:37,181 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 23 states. [2018-11-23 12:07:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:39,047 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-11-23 12:07:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:07:39,047 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 12:07:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:07:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 156 transitions. [2018-11-23 12:07:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:07:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 156 transitions. [2018-11-23 12:07:39,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 156 transitions. [2018-11-23 12:07:39,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:39,360 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:07:39,360 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:07:39,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:07:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:07:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 59. [2018-11-23 12:07:39,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:39,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 59 states. [2018-11-23 12:07:39,406 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 59 states. [2018-11-23 12:07:39,406 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 59 states. [2018-11-23 12:07:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:39,409 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-11-23 12:07:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-11-23 12:07:39,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:39,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:39,410 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 119 states. [2018-11-23 12:07:39,410 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 119 states. [2018-11-23 12:07:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:39,413 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-11-23 12:07:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-11-23 12:07:39,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:39,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:39,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:39,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:07:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 12:07:39,416 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 53 [2018-11-23 12:07:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:39,416 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 12:07:39,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:07:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 12:07:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:07:39,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:39,417 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:39,417 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:39,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash -376609690, now seen corresponding path program 20 times [2018-11-23 12:07:39,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:39,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:39,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:40,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {9808#true} call ULTIMATE.init(); {9808#true} is VALID [2018-11-23 12:07:40,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {9808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9808#true} is VALID [2018-11-23 12:07:40,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {9808#true} assume true; {9808#true} is VALID [2018-11-23 12:07:40,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9808#true} {9808#true} #60#return; {9808#true} is VALID [2018-11-23 12:07:40,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {9808#true} call #t~ret4 := main(); {9808#true} is VALID [2018-11-23 12:07:40,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {9808#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {9810#(= main_~i~0 0)} is VALID [2018-11-23 12:07:40,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {9810#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9811#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:40,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {9811#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9812#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:40,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {9812#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9813#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:40,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {9813#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9814#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:40,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {9814#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9815#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:40,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {9815#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9816#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:40,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {9816#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9817#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:40,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {9817#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9818#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:40,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {9818#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9819#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:40,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {9819#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9820#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:40,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {9820#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9821#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:40,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {9821#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9822#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:40,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {9822#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9823#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:40,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {9823#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9824#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:40,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {9824#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9825#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:40,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {9825#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9826#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:40,166 INFO L273 TraceCheckUtils]: 22: Hoare triple {9826#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9827#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:40,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {9827#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9828#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:40,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {9828#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9829#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:40,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {9829#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9830#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:40,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {9830#(<= main_~i~0 20)} assume !(~i~0 < 10000); {9809#false} is VALID [2018-11-23 12:07:40,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {9809#false} ~i~0 := 0; {9809#false} is VALID [2018-11-23 12:07:40,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,172 INFO L273 TraceCheckUtils]: 33: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,173 INFO L273 TraceCheckUtils]: 34: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,176 INFO L273 TraceCheckUtils]: 48: Hoare triple {9809#false} assume !(~i~0 < 10000); {9809#false} is VALID [2018-11-23 12:07:40,176 INFO L273 TraceCheckUtils]: 49: Hoare triple {9809#false} ~i~0 := 0;~j~0 := 0; {9809#false} is VALID [2018-11-23 12:07:40,176 INFO L273 TraceCheckUtils]: 50: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {9809#false} is VALID [2018-11-23 12:07:40,177 INFO L256 TraceCheckUtils]: 51: Hoare triple {9809#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9809#false} is VALID [2018-11-23 12:07:40,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {9809#false} ~cond := #in~cond; {9809#false} is VALID [2018-11-23 12:07:40,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {9809#false} assume 0 == ~cond; {9809#false} is VALID [2018-11-23 12:07:40,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2018-11-23 12:07:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:07:40,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:40,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:40,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:40,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:40,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:40,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:40,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {9808#true} call ULTIMATE.init(); {9808#true} is VALID [2018-11-23 12:07:40,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {9808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9808#true} is VALID [2018-11-23 12:07:40,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {9808#true} assume true; {9808#true} is VALID [2018-11-23 12:07:40,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9808#true} {9808#true} #60#return; {9808#true} is VALID [2018-11-23 12:07:40,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {9808#true} call #t~ret4 := main(); {9808#true} is VALID [2018-11-23 12:07:40,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {9808#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {9849#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:40,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {9849#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9811#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:40,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {9811#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9812#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:40,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {9812#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9813#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:40,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {9813#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9814#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:40,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {9814#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9815#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:40,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {9815#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9816#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:40,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {9816#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9817#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:40,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {9817#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9818#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:40,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {9818#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9819#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:40,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {9819#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9820#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:40,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {9820#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9821#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:40,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {9821#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9822#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:40,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {9822#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9823#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:40,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {9823#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9824#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:40,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {9824#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9825#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:40,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {9825#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9826#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:40,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {9826#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9827#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:40,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {9827#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9828#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:40,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {9828#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9829#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:40,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {9829#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9830#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:40,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {9830#(<= main_~i~0 20)} assume !(~i~0 < 10000); {9809#false} is VALID [2018-11-23 12:07:40,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {9809#false} ~i~0 := 0; {9809#false} is VALID [2018-11-23 12:07:40,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,480 INFO L273 TraceCheckUtils]: 40: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,482 INFO L273 TraceCheckUtils]: 46: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,482 INFO L273 TraceCheckUtils]: 47: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {9809#false} is VALID [2018-11-23 12:07:40,482 INFO L273 TraceCheckUtils]: 48: Hoare triple {9809#false} assume !(~i~0 < 10000); {9809#false} is VALID [2018-11-23 12:07:40,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {9809#false} ~i~0 := 0;~j~0 := 0; {9809#false} is VALID [2018-11-23 12:07:40,483 INFO L273 TraceCheckUtils]: 50: Hoare triple {9809#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {9809#false} is VALID [2018-11-23 12:07:40,483 INFO L256 TraceCheckUtils]: 51: Hoare triple {9809#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9809#false} is VALID [2018-11-23 12:07:40,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {9809#false} ~cond := #in~cond; {9809#false} is VALID [2018-11-23 12:07:40,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {9809#false} assume 0 == ~cond; {9809#false} is VALID [2018-11-23 12:07:40,483 INFO L273 TraceCheckUtils]: 54: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2018-11-23 12:07:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:07:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:40,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:07:40,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-23 12:07:40,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:40,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:07:40,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:40,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:07:40,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:07:40,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:07:40,541 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 24 states. [2018-11-23 12:07:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,654 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2018-11-23 12:07:45,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:07:45,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-23 12:07:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:07:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 162 transitions. [2018-11-23 12:07:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:07:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 162 transitions. [2018-11-23 12:07:45,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 162 transitions. [2018-11-23 12:07:45,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:45,837 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:07:45,838 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 12:07:45,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:07:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 12:07:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61. [2018-11-23 12:07:45,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:45,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 61 states. [2018-11-23 12:07:45,877 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 61 states. [2018-11-23 12:07:45,877 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 61 states. [2018-11-23 12:07:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,880 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2018-11-23 12:07:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2018-11-23 12:07:45,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:45,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:45,882 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 124 states. [2018-11-23 12:07:45,882 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 124 states. [2018-11-23 12:07:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,885 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2018-11-23 12:07:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2018-11-23 12:07:45,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:45,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:45,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:45,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:07:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-23 12:07:45,887 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 55 [2018-11-23 12:07:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:45,888 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-23 12:07:45,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:07:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 12:07:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:07:45,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:45,889 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:45,889 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:45,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1505972475, now seen corresponding path program 21 times [2018-11-23 12:07:45,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:45,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:45,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:46,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {10629#true} call ULTIMATE.init(); {10629#true} is VALID [2018-11-23 12:07:46,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {10629#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10629#true} is VALID [2018-11-23 12:07:46,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {10629#true} assume true; {10629#true} is VALID [2018-11-23 12:07:46,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10629#true} {10629#true} #60#return; {10629#true} is VALID [2018-11-23 12:07:46,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {10629#true} call #t~ret4 := main(); {10629#true} is VALID [2018-11-23 12:07:46,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {10629#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {10631#(= main_~i~0 0)} is VALID [2018-11-23 12:07:46,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {10631#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10632#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:46,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {10632#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10633#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:46,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {10633#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10634#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:46,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {10634#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10635#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:46,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {10635#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10636#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:46,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {10636#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10637#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:46,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {10637#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10638#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:46,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {10638#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10639#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:46,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {10639#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10640#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:46,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {10640#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10641#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:46,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {10641#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10642#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:46,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {10642#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10643#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:46,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {10643#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10644#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:46,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {10644#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10645#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:46,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {10645#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10646#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:46,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {10646#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10647#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:46,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {10647#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10648#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:46,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {10648#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10649#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:46,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {10649#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10650#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:46,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {10650#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10651#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:46,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {10651#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10652#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:46,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {10652#(<= main_~i~0 21)} assume !(~i~0 < 10000); {10630#false} is VALID [2018-11-23 12:07:46,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {10630#false} ~i~0 := 0; {10630#false} is VALID [2018-11-23 12:07:46,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,455 INFO L273 TraceCheckUtils]: 32: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 41: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 48: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 49: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {10630#false} assume !(~i~0 < 10000); {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {10630#false} ~i~0 := 0;~j~0 := 0; {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L256 TraceCheckUtils]: 53: Hoare triple {10630#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {10630#false} ~cond := #in~cond; {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {10630#false} assume 0 == ~cond; {10630#false} is VALID [2018-11-23 12:07:46,458 INFO L273 TraceCheckUtils]: 56: Hoare triple {10630#false} assume !false; {10630#false} is VALID [2018-11-23 12:07:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 12:07:46,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:46,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:46,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:32,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:08:32,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:32,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:32,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {10629#true} call ULTIMATE.init(); {10629#true} is VALID [2018-11-23 12:08:32,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {10629#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10629#true} is VALID [2018-11-23 12:08:32,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {10629#true} assume true; {10629#true} is VALID [2018-11-23 12:08:32,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10629#true} {10629#true} #60#return; {10629#true} is VALID [2018-11-23 12:08:32,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {10629#true} call #t~ret4 := main(); {10629#true} is VALID [2018-11-23 12:08:32,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {10629#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {10671#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:32,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {10671#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10632#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:32,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {10632#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10633#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:32,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {10633#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10634#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:32,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {10634#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10635#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:32,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {10635#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10636#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:32,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {10636#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10637#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:32,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {10637#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10638#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:32,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {10638#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10639#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:32,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {10639#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10640#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:32,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {10640#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10641#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:32,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {10641#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10642#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:32,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {10642#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10643#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:32,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {10643#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10644#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:32,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {10644#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10645#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:32,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {10645#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10646#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:32,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {10646#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10647#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:32,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {10647#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10648#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:32,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {10648#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10649#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:32,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {10649#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10650#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:32,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {10650#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10651#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:32,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {10651#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10652#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:32,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {10652#(<= main_~i~0 21)} assume !(~i~0 < 10000); {10630#false} is VALID [2018-11-23 12:08:32,830 INFO L273 TraceCheckUtils]: 28: Hoare triple {10630#false} ~i~0 := 0; {10630#false} is VALID [2018-11-23 12:08:32,830 INFO L273 TraceCheckUtils]: 29: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,830 INFO L273 TraceCheckUtils]: 30: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,831 INFO L273 TraceCheckUtils]: 32: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,831 INFO L273 TraceCheckUtils]: 35: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,832 INFO L273 TraceCheckUtils]: 40: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,832 INFO L273 TraceCheckUtils]: 41: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,832 INFO L273 TraceCheckUtils]: 42: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 43: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 44: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 47: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {10630#false} is VALID [2018-11-23 12:08:32,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {10630#false} assume !(~i~0 < 10000); {10630#false} is VALID [2018-11-23 12:08:32,834 INFO L273 TraceCheckUtils]: 51: Hoare triple {10630#false} ~i~0 := 0;~j~0 := 0; {10630#false} is VALID [2018-11-23 12:08:32,834 INFO L273 TraceCheckUtils]: 52: Hoare triple {10630#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {10630#false} is VALID [2018-11-23 12:08:32,834 INFO L256 TraceCheckUtils]: 53: Hoare triple {10630#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10630#false} is VALID [2018-11-23 12:08:32,834 INFO L273 TraceCheckUtils]: 54: Hoare triple {10630#false} ~cond := #in~cond; {10630#false} is VALID [2018-11-23 12:08:32,834 INFO L273 TraceCheckUtils]: 55: Hoare triple {10630#false} assume 0 == ~cond; {10630#false} is VALID [2018-11-23 12:08:32,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {10630#false} assume !false; {10630#false} is VALID [2018-11-23 12:08:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 12:08:32,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:32,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:08:32,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-23 12:08:32,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:32,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:08:32,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:32,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:08:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:08:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:08:32,895 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 25 states. [2018-11-23 12:08:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:34,486 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2018-11-23 12:08:34,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:08:34,486 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-23 12:08:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 168 transitions. [2018-11-23 12:08:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 168 transitions. [2018-11-23 12:08:34,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 168 transitions. [2018-11-23 12:08:34,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:34,662 INFO L225 Difference]: With dead ends: 162 [2018-11-23 12:08:34,662 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 12:08:34,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:08:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 12:08:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 63. [2018-11-23 12:08:34,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:34,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 63 states. [2018-11-23 12:08:34,753 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 63 states. [2018-11-23 12:08:34,753 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 63 states. [2018-11-23 12:08:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:34,755 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2018-11-23 12:08:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-11-23 12:08:34,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:34,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:34,756 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 129 states. [2018-11-23 12:08:34,756 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 129 states. [2018-11-23 12:08:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:34,760 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2018-11-23 12:08:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-11-23 12:08:34,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:34,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:34,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:34,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:08:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 12:08:34,762 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 57 [2018-11-23 12:08:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:34,763 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 12:08:34,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:08:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 12:08:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:08:34,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:34,764 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:34,764 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:34,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash -819523258, now seen corresponding path program 22 times [2018-11-23 12:08:34,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:34,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:35,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {11482#true} call ULTIMATE.init(); {11482#true} is VALID [2018-11-23 12:08:35,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {11482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11482#true} is VALID [2018-11-23 12:08:35,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {11482#true} assume true; {11482#true} is VALID [2018-11-23 12:08:35,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11482#true} {11482#true} #60#return; {11482#true} is VALID [2018-11-23 12:08:35,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {11482#true} call #t~ret4 := main(); {11482#true} is VALID [2018-11-23 12:08:35,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {11482#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {11484#(= main_~i~0 0)} is VALID [2018-11-23 12:08:35,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {11484#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11485#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:35,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {11485#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11486#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:35,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {11486#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11487#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:35,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {11487#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11488#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:35,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {11488#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11489#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:35,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {11489#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11490#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:35,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {11490#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11491#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:35,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {11491#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11492#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:35,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {11492#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11493#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:35,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {11493#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11494#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:35,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {11494#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11495#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:35,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {11495#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11496#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:35,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {11496#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11497#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:35,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {11497#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11498#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:35,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {11498#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11499#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:35,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {11499#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11500#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:35,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {11500#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11501#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:35,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {11501#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11502#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:35,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {11502#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11503#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:35,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {11503#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11504#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:35,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {11504#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11505#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:35,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {11505#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11506#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:35,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {11506#(<= main_~i~0 22)} assume !(~i~0 < 10000); {11483#false} is VALID [2018-11-23 12:08:35,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {11483#false} ~i~0 := 0; {11483#false} is VALID [2018-11-23 12:08:35,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,530 INFO L273 TraceCheckUtils]: 36: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,533 INFO L273 TraceCheckUtils]: 52: Hoare triple {11483#false} assume !(~i~0 < 10000); {11483#false} is VALID [2018-11-23 12:08:35,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {11483#false} ~i~0 := 0;~j~0 := 0; {11483#false} is VALID [2018-11-23 12:08:35,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {11483#false} is VALID [2018-11-23 12:08:35,534 INFO L256 TraceCheckUtils]: 55: Hoare triple {11483#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11483#false} is VALID [2018-11-23 12:08:35,534 INFO L273 TraceCheckUtils]: 56: Hoare triple {11483#false} ~cond := #in~cond; {11483#false} is VALID [2018-11-23 12:08:35,534 INFO L273 TraceCheckUtils]: 57: Hoare triple {11483#false} assume 0 == ~cond; {11483#false} is VALID [2018-11-23 12:08:35,534 INFO L273 TraceCheckUtils]: 58: Hoare triple {11483#false} assume !false; {11483#false} is VALID [2018-11-23 12:08:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:08:35,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:35,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:35,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:35,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:35,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:35,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {11482#true} call ULTIMATE.init(); {11482#true} is VALID [2018-11-23 12:08:35,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {11482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11482#true} is VALID [2018-11-23 12:08:35,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {11482#true} assume true; {11482#true} is VALID [2018-11-23 12:08:35,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11482#true} {11482#true} #60#return; {11482#true} is VALID [2018-11-23 12:08:35,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {11482#true} call #t~ret4 := main(); {11482#true} is VALID [2018-11-23 12:08:35,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {11482#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {11525#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:35,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {11525#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11485#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:35,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {11485#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11486#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:35,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {11486#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11487#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:35,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {11487#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11488#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:35,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {11488#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11489#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:35,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {11489#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11490#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:35,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {11490#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11491#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:35,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {11491#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11492#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:35,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {11492#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11493#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:35,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {11493#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11494#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:35,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {11494#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11495#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:35,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {11495#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11496#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:35,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {11496#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11497#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:35,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {11497#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11498#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:35,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {11498#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11499#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:35,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {11499#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11500#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:35,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {11500#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11501#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:35,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {11501#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11502#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:35,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {11502#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11503#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:35,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {11503#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11504#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:35,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {11504#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11505#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:35,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {11505#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11506#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:35,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {11506#(<= main_~i~0 22)} assume !(~i~0 < 10000); {11483#false} is VALID [2018-11-23 12:08:35,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {11483#false} ~i~0 := 0; {11483#false} is VALID [2018-11-23 12:08:35,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,877 INFO L273 TraceCheckUtils]: 39: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,878 INFO L273 TraceCheckUtils]: 47: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,878 INFO L273 TraceCheckUtils]: 48: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 49: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 50: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 51: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {11483#false} assume !(~i~0 < 10000); {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {11483#false} ~i~0 := 0;~j~0 := 0; {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {11483#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L256 TraceCheckUtils]: 55: Hoare triple {11483#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {11483#false} ~cond := #in~cond; {11483#false} is VALID [2018-11-23 12:08:35,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {11483#false} assume 0 == ~cond; {11483#false} is VALID [2018-11-23 12:08:35,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {11483#false} assume !false; {11483#false} is VALID [2018-11-23 12:08:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:08:35,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:35,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:08:35,901 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 12:08:35,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:35,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:08:35,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:35,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:08:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:08:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:08:35,933 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 26 states. [2018-11-23 12:08:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,945 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2018-11-23 12:08:37,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:08:37,945 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 12:08:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:08:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 174 transitions. [2018-11-23 12:08:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:08:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 174 transitions. [2018-11-23 12:08:37,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 174 transitions. [2018-11-23 12:08:38,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:38,136 INFO L225 Difference]: With dead ends: 168 [2018-11-23 12:08:38,136 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 12:08:38,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:08:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 12:08:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 65. [2018-11-23 12:08:38,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:38,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 65 states. [2018-11-23 12:08:38,181 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 65 states. [2018-11-23 12:08:38,181 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 65 states. [2018-11-23 12:08:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,185 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2018-11-23 12:08:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2018-11-23 12:08:38,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:38,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:38,186 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 134 states. [2018-11-23 12:08:38,186 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 134 states. [2018-11-23 12:08:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,190 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2018-11-23 12:08:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2018-11-23 12:08:38,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:38,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:38,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:38,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:08:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 12:08:38,193 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 59 [2018-11-23 12:08:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:38,193 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 12:08:38,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:08:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 12:08:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:08:38,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:38,194 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:38,194 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:38,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash -393801691, now seen corresponding path program 23 times [2018-11-23 12:08:38,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:38,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:38,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:38,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:38,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {12367#true} call ULTIMATE.init(); {12367#true} is VALID [2018-11-23 12:08:38,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {12367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12367#true} is VALID [2018-11-23 12:08:38,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {12367#true} assume true; {12367#true} is VALID [2018-11-23 12:08:38,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12367#true} {12367#true} #60#return; {12367#true} is VALID [2018-11-23 12:08:38,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {12367#true} call #t~ret4 := main(); {12367#true} is VALID [2018-11-23 12:08:38,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {12367#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {12369#(= main_~i~0 0)} is VALID [2018-11-23 12:08:38,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {12369#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12370#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:38,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {12370#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12371#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:38,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {12371#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12372#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:38,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {12372#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12373#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:38,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {12373#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12374#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:38,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {12374#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12375#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:38,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {12375#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12376#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:38,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {12376#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12377#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:38,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {12377#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12378#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:38,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {12378#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12379#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:38,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {12379#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12380#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:38,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {12380#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12381#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:38,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {12381#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12382#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:38,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {12382#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12383#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:38,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {12383#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12384#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:38,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {12384#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12385#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:38,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {12385#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12386#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:38,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {12386#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12387#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:38,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {12387#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12388#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:38,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {12388#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12389#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:38,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {12389#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12390#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:38,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {12390#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12391#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:38,719 INFO L273 TraceCheckUtils]: 28: Hoare triple {12391#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12392#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:38,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {12392#(<= main_~i~0 23)} assume !(~i~0 < 10000); {12368#false} is VALID [2018-11-23 12:08:38,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {12368#false} ~i~0 := 0; {12368#false} is VALID [2018-11-23 12:08:38,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,720 INFO L273 TraceCheckUtils]: 33: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,721 INFO L273 TraceCheckUtils]: 35: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,722 INFO L273 TraceCheckUtils]: 39: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,722 INFO L273 TraceCheckUtils]: 41: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,722 INFO L273 TraceCheckUtils]: 43: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 44: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 45: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 46: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 47: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 48: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 50: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 51: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 53: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 54: Hoare triple {12368#false} assume !(~i~0 < 10000); {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 55: Hoare triple {12368#false} ~i~0 := 0;~j~0 := 0; {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 56: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L256 TraceCheckUtils]: 57: Hoare triple {12368#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 58: Hoare triple {12368#false} ~cond := #in~cond; {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 59: Hoare triple {12368#false} assume 0 == ~cond; {12368#false} is VALID [2018-11-23 12:08:38,724 INFO L273 TraceCheckUtils]: 60: Hoare triple {12368#false} assume !false; {12368#false} is VALID [2018-11-23 12:08:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 12:08:38,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:38,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:38,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:43,986 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 12:09:43,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:44,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:44,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {12367#true} call ULTIMATE.init(); {12367#true} is VALID [2018-11-23 12:09:44,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {12367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12367#true} is VALID [2018-11-23 12:09:44,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {12367#true} assume true; {12367#true} is VALID [2018-11-23 12:09:44,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12367#true} {12367#true} #60#return; {12367#true} is VALID [2018-11-23 12:09:44,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {12367#true} call #t~ret4 := main(); {12367#true} is VALID [2018-11-23 12:09:44,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {12367#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {12411#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:44,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {12411#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12370#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:44,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {12370#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12371#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:44,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {12371#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12372#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:44,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {12372#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12373#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:44,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {12373#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12374#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:44,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {12374#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12375#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:44,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {12375#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12376#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:44,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {12376#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12377#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:44,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {12377#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12378#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:44,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {12378#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12379#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:44,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {12379#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12380#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:44,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {12380#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12381#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:44,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {12381#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12382#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:44,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {12382#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12383#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:44,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {12383#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12384#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:44,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {12384#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12385#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:44,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {12385#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12386#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:44,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {12386#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12387#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:44,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {12387#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12388#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:44,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {12388#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12389#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:44,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {12389#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12390#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:44,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {12390#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12391#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:44,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {12391#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12392#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:44,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {12392#(<= main_~i~0 23)} assume !(~i~0 < 10000); {12368#false} is VALID [2018-11-23 12:09:44,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {12368#false} ~i~0 := 0; {12368#false} is VALID [2018-11-23 12:09:44,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,218 INFO L273 TraceCheckUtils]: 38: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,219 INFO L273 TraceCheckUtils]: 43: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 47: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 48: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 50: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 51: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,220 INFO L273 TraceCheckUtils]: 52: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 53: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {12368#false} assume !(~i~0 < 10000); {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 55: Hoare triple {12368#false} ~i~0 := 0;~j~0 := 0; {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 56: Hoare triple {12368#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L256 TraceCheckUtils]: 57: Hoare triple {12368#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 58: Hoare triple {12368#false} ~cond := #in~cond; {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 59: Hoare triple {12368#false} assume 0 == ~cond; {12368#false} is VALID [2018-11-23 12:09:44,221 INFO L273 TraceCheckUtils]: 60: Hoare triple {12368#false} assume !false; {12368#false} is VALID [2018-11-23 12:09:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 12:09:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:44,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:09:44,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-23 12:09:44,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:44,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:09:44,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:44,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:09:44,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:09:44,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:09:44,286 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 27 states. [2018-11-23 12:09:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:45,898 INFO L93 Difference]: Finished difference Result 174 states and 203 transitions. [2018-11-23 12:09:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:09:45,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-23 12:09:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:09:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 180 transitions. [2018-11-23 12:09:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:09:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 180 transitions. [2018-11-23 12:09:45,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 180 transitions. [2018-11-23 12:09:46,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:46,089 INFO L225 Difference]: With dead ends: 174 [2018-11-23 12:09:46,089 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:09:46,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:09:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:09:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 67. [2018-11-23 12:09:46,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:46,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 67 states. [2018-11-23 12:09:46,226 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 67 states. [2018-11-23 12:09:46,227 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 67 states. [2018-11-23 12:09:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:46,230 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2018-11-23 12:09:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2018-11-23 12:09:46,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:46,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:46,232 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 139 states. [2018-11-23 12:09:46,232 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 139 states. [2018-11-23 12:09:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:46,235 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2018-11-23 12:09:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2018-11-23 12:09:46,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:46,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:46,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:46,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:09:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-23 12:09:46,238 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 61 [2018-11-23 12:09:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:46,238 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 12:09:46,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:09:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 12:09:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:09:46,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:46,239 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:46,239 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:46,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -654129626, now seen corresponding path program 24 times [2018-11-23 12:09:46,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:46,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:46,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:47,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {13284#true} call ULTIMATE.init(); {13284#true} is VALID [2018-11-23 12:09:47,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {13284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13284#true} is VALID [2018-11-23 12:09:47,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {13284#true} assume true; {13284#true} is VALID [2018-11-23 12:09:47,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13284#true} {13284#true} #60#return; {13284#true} is VALID [2018-11-23 12:09:47,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {13284#true} call #t~ret4 := main(); {13284#true} is VALID [2018-11-23 12:09:47,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {13284#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {13286#(= main_~i~0 0)} is VALID [2018-11-23 12:09:47,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {13286#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13287#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:47,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {13287#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13288#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:47,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {13288#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13289#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:47,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {13289#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13290#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:47,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {13290#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13291#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:47,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {13291#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13292#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:47,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {13292#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13293#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:47,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {13293#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13294#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:47,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {13294#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13295#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:47,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {13295#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13296#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:47,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {13296#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13297#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:47,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {13297#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13298#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:47,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {13298#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13299#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:47,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {13299#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13300#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:47,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {13300#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13301#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:47,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {13301#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13302#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:47,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {13302#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13303#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:47,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {13303#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13304#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:47,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {13304#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13305#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:47,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {13305#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13306#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:47,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {13306#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13307#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:47,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {13307#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13308#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:47,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {13308#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13309#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:47,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {13309#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13310#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:47,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {13310#(<= main_~i~0 24)} assume !(~i~0 < 10000); {13285#false} is VALID [2018-11-23 12:09:47,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {13285#false} ~i~0 := 0; {13285#false} is VALID [2018-11-23 12:09:47,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,425 INFO L273 TraceCheckUtils]: 39: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,426 INFO L273 TraceCheckUtils]: 41: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,426 INFO L273 TraceCheckUtils]: 42: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,426 INFO L273 TraceCheckUtils]: 43: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,426 INFO L273 TraceCheckUtils]: 45: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,427 INFO L273 TraceCheckUtils]: 46: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,427 INFO L273 TraceCheckUtils]: 47: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,427 INFO L273 TraceCheckUtils]: 48: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,427 INFO L273 TraceCheckUtils]: 49: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 51: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 54: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 55: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 1 + ~i~0;~j~0 := 1 + ~j~0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 56: Hoare triple {13285#false} assume !(~i~0 < 10000); {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {13285#false} ~i~0 := 0;~j~0 := 0; {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {13285#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~j~0, 4); {13285#false} is VALID [2018-11-23 12:09:47,428 INFO L256 TraceCheckUtils]: 59: Hoare triple {13285#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13285#false} is VALID [2018-11-23 12:09:47,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {13285#false} ~cond := #in~cond; {13285#false} is VALID [2018-11-23 12:09:47,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {13285#false} assume 0 == ~cond; {13285#false} is VALID [2018-11-23 12:09:47,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {13285#false} assume !false; {13285#false} is VALID [2018-11-23 12:09:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:09:47,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:47,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:47,440 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE