/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:44,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:44,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:44,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:44,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:44,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:44,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:44,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:44,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:44,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:44,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:44,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:44,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:44,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:44,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:44,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:44,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:44,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:44,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:44,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:44,116 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:44,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:44,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:44,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:44,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:44,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:44,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:44,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:44,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:44,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:44,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:44,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:44,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:44,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:44,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:44,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:44,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:44,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:44,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:44,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:44,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:44,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:44,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:44,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:44,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:44,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:44,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:44,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:44,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:44,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:44,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:44,139 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:44,140 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:01:44,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:44,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:44,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:44,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:44,361 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:44,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2022-04-15 12:01:44,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae310b24/538526462ad24d5a9c1470f6efa397bf/FLAGae14c411f [2022-04-15 12:01:44,917 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:44,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2022-04-15 12:01:44,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae310b24/538526462ad24d5a9c1470f6efa397bf/FLAGae14c411f [2022-04-15 12:01:45,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae310b24/538526462ad24d5a9c1470f6efa397bf [2022-04-15 12:01:45,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:45,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:45,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:45,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:45,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:45,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f21e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45, skipping insertion in model container [2022-04-15 12:01:45,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:45,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:45,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-04-15 12:01:45,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:45,605 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:45,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-04-15 12:01:45,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:45,640 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:45,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45 WrapperNode [2022-04-15 12:01:45,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:45,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:45,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:45,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:45,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:45,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:45,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:45,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:45,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (1/1) ... [2022-04-15 12:01:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:45,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:45,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:01:45,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:01:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:01:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:01:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:45,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:45,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:45,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:45,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:45,804 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:45,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:46,005 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:46,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:46,010 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:01:46,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:46 BoogieIcfgContainer [2022-04-15 12:01:46,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:46,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:46,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:46,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:45" (1/3) ... [2022-04-15 12:01:46,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d62be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:46, skipping insertion in model container [2022-04-15 12:01:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:45" (2/3) ... [2022-04-15 12:01:46,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d62be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:46, skipping insertion in model container [2022-04-15 12:01:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:46" (3/3) ... [2022-04-15 12:01:46,031 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2022-04-15 12:01:46,035 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:46,036 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:46,070 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:46,076 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:01:46,076 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:01:46,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:46,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:46,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2022-04-15 12:01:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [631648997] [2022-04-15 12:01:46,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 2 times [2022-04-15 12:01:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:46,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280721757] [2022-04-15 12:01:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-15 12:01:46,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 12:01:46,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-15 12:01:46,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:46,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-15 12:01:46,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 12:01:46,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-15 12:01:46,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret13 := main(); {30#true} is VALID [2022-04-15 12:01:46,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:01:46,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:01:46,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {36#(and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:46,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {31#false} is VALID [2022-04-15 12:01:46,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {31#false} is VALID [2022-04-15 12:01:46,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {31#false} is VALID [2022-04-15 12:01:46,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {31#false} is VALID [2022-04-15 12:01:46,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-15 12:01:46,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-15 12:01:46,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-15 12:01:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:46,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280721757] [2022-04-15 12:01:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280721757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:46,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:46,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [631648997] [2022-04-15 12:01:46,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [631648997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126422171] [2022-04-15 12:01:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:01:46,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:46,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:46,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:46,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:46,425 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,752 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-15 12:01:46,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:01:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 12:01:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 12:01:46,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-15 12:01:46,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,843 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:01:46,844 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:01:46,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:01:46,848 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:46,849 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:01:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 12:01:46,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:46,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:46,884 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:46,885 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,887 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:46,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:46,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:46,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-15 12:01:46,888 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-15 12:01:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,890 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:46,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:46,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:46,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:46,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 12:01:46,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2022-04-15 12:01:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:46,893 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 12:01:46,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:46,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 12:01:46,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:01:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:01:46,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:46,925 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:46,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:46,925 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2022-04-15 12:01:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [809222269] [2022-04-15 12:01:46,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:46,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 2 times [2022-04-15 12:01:46,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:46,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267733379] [2022-04-15 12:01:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:46,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:01:47,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:01:47,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #67#return; {234#true} is VALID [2022-04-15 12:01:47,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:47,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:01:47,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:01:47,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #67#return; {234#true} is VALID [2022-04-15 12:01:47,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret13 := main(); {234#true} is VALID [2022-04-15 12:01:47,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {239#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} is VALID [2022-04-15 12:01:47,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {235#false} is VALID [2022-04-15 12:01:47,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {235#false} is VALID [2022-04-15 12:01:47,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {235#false} is VALID [2022-04-15 12:01:47,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {235#false} is VALID [2022-04-15 12:01:47,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume !(~i~0 >= 0); {235#false} is VALID [2022-04-15 12:01:47,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {235#false} is VALID [2022-04-15 12:01:47,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {235#false} is VALID [2022-04-15 12:01:47,064 INFO L272 TraceCheckUtils]: 13: Hoare triple {235#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {235#false} is VALID [2022-04-15 12:01:47,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:01:47,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:01:47,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:01:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267733379] [2022-04-15 12:01:47,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267733379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:47,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:47,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [809222269] [2022-04-15 12:01:47,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [809222269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:47,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:47,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:47,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000528566] [2022-04-15 12:01:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:01:47,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:47,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:47,089 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,198 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:01:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:01:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:01:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 12:01:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 12:01:47,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-15 12:01:47,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,272 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:01:47,272 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:01:47,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:47,273 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:47,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:01:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 12:01:47,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:47,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:47,315 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:47,316 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,317 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:01:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:01:47,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-15 12:01:47,318 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-15 12:01:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,319 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:01:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:01:47,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:47,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 12:01:47,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-15 12:01:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:47,320 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 12:01:47,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 12:01:47,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:01:47,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:47,351 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:47,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:47,352 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2022-04-15 12:01:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170692091] [2022-04-15 12:01:47,370 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:47,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 2 times [2022-04-15 12:01:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:47,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846556386] [2022-04-15 12:01:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 12:01:47,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:01:47,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:01:47,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:47,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 12:01:47,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:01:47,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:01:47,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2022-04-15 12:01:47,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {428#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:47,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {428#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:47,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {429#(and (<= (+ main_~i~0 4) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-15 12:01:47,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(and (<= (+ main_~i~0 4) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {424#false} assume !(~i~0 >= 0); {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {424#false} is VALID [2022-04-15 12:01:47,545 INFO L272 TraceCheckUtils]: 15: Hoare triple {424#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {424#false} is VALID [2022-04-15 12:01:47,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-15 12:01:47,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-15 12:01:47,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 12:01:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:47,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846556386] [2022-04-15 12:01:47,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846556386] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733667999] [2022-04-15 12:01:47,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:47,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:01:47,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:47,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:47,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:01:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:47,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:01:47,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 12:01:48,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:48,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:48,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 12:01:48,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-15 12:01:48,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 12:01:48,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:01:48,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:01:48,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2022-04-15 12:01:48,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {462#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:01:48,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {466#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {470#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))))} is VALID [2022-04-15 12:01:48,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {470#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))))} assume !(~i~0 >= 0); {474#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:01:48,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {474#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {478#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:48,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {478#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {482#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:01:48,588 INFO L272 TraceCheckUtils]: 15: Hoare triple {482#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:48,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:48,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-15 12:01:48,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 12:01:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:48,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:48,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:48,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:01:48,886 INFO L356 Elim1Store]: treesize reduction 26, result has 39.5 percent of original size [2022-04-15 12:01:48,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 102 [2022-04-15 12:01:48,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:48,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 12:01:48,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:01:48,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:48,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:01:48,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:48,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:01:49,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:01:49,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:49,032 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:01:49,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 89 [2022-04-15 12:01:49,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 12:01:49,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-15 12:01:49,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:49,948 INFO L272 TraceCheckUtils]: 15: Hoare triple {482#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:49,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {482#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:01:49,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {513#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {509#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:49,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {513#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:01:49,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {521#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {517#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:01:49,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {521#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:49,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {525#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:49,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {423#true} is VALID [2022-04-15 12:01:49,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {423#true} is VALID [2022-04-15 12:01:49,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {423#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {423#true} is VALID [2022-04-15 12:01:49,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {423#true} is VALID [2022-04-15 12:01:49,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2022-04-15 12:01:49,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:01:49,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:01:49,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 12:01:49,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-15 12:01:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733667999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:49,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10] total 19 [2022-04-15 12:01:49,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:49,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170692091] [2022-04-15 12:01:49,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170692091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465864451] [2022-04-15 12:01:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:01:49,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:49,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:49,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:49,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:01:49,971 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,107 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 12:01:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:01:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 12:01:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 12:01:50,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 12:01:50,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,139 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:01:50,139 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:01:50,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:01:50,140 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:50,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:01:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 12:01:50,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:50,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:50,160 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:50,160 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,161 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:01:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:01:50,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 12:01:50,162 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 12:01:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,167 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:01:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:01:50,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:50,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:01:50,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-04-15 12:01:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:50,169 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:01:50,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:01:50,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:01:50,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:50,332 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:50,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:50,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:50,545 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 3 times [2022-04-15 12:01:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168462995] [2022-04-15 12:01:50,553 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:50,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 4 times [2022-04-15 12:01:50,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:50,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676941157] [2022-04-15 12:01:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:50,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {752#true} is VALID [2022-04-15 12:01:50,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2022-04-15 12:01:50,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #67#return; {752#true} is VALID [2022-04-15 12:01:50,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:50,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {752#true} is VALID [2022-04-15 12:01:50,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2022-04-15 12:01:50,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #67#return; {752#true} is VALID [2022-04-15 12:01:50,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret13 := main(); {752#true} is VALID [2022-04-15 12:01:50,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {752#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {757#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:50,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {757#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {757#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:50,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {758#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} is VALID [2022-04-15 12:01:50,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {758#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {758#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} is VALID [2022-04-15 12:01:50,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {758#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {759#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-15 12:01:50,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#false} assume !(~i~0 >= 0); {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {753#false} is VALID [2022-04-15 12:01:50,750 INFO L272 TraceCheckUtils]: 17: Hoare triple {753#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {753#false} is VALID [2022-04-15 12:01:50,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2022-04-15 12:01:50,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2022-04-15 12:01:50,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-04-15 12:01:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:50,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676941157] [2022-04-15 12:01:50,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676941157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:50,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373759089] [2022-04-15 12:01:50,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:50,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:50,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:01:50,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:50,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:50,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:01:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:50,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:01:51,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 12:01:51,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:52,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:52,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 12:01:52,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2022-04-15 12:01:52,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {752#true} is VALID [2022-04-15 12:01:52,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2022-04-15 12:01:52,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #67#return; {752#true} is VALID [2022-04-15 12:01:52,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret13 := main(); {752#true} is VALID [2022-04-15 12:01:52,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {752#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {779#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {798#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:01:52,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {798#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {802#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {802#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {806#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:52,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {810#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:01:52,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {810#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {814#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:52,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {814#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {818#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:01:52,966 INFO L272 TraceCheckUtils]: 17: Hoare triple {818#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:52,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:52,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {753#false} is VALID [2022-04-15 12:01:52,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-04-15 12:01:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:01:52,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:53,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:53,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:01:53,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,374 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:01:53,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-04-15 12:01:53,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 12:01:53,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:01:53,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-04-15 12:01:53,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:01:53,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,517 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:01:53,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 42 [2022-04-15 12:01:53,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 12:01:53,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,613 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:53,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:01:53,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 16 [2022-04-15 12:01:53,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:01:53,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,701 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:01:53,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 39 [2022-04-15 12:01:53,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:01:53,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,763 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-04-15 12:01:53,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2022-04-15 12:01:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:01:53,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:53,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:54,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-04-15 12:01:54,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {753#false} is VALID [2022-04-15 12:01:54,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:54,982 INFO L272 TraceCheckUtils]: 17: Hoare triple {818#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:54,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {818#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:01:54,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {849#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {845#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:54,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {849#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:01:54,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {853#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:01:54,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {861#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {857#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:54,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {752#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {861#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {752#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {752#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {752#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {752#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {752#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret13 := main(); {752#true} is VALID [2022-04-15 12:01:54,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #67#return; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2022-04-15 12:01:54,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {752#true} is VALID [2022-04-15 12:01:54,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2022-04-15 12:01:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:01:54,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373759089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:54,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:54,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 20 [2022-04-15 12:01:54,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:54,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168462995] [2022-04-15 12:01:54,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168462995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:54,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:54,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:01:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94200013] [2022-04-15 12:01:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:54,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:01:54,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:54,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:55,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:01:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:01:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:01:55,016 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:55,333 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 12:01:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:01:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:01:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 12:01:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 12:01:55,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-15 12:01:55,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:55,399 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:01:55,399 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:01:55,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:01:55,400 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:55,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:01:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 12:01:55,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:55,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:55,431 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:55,431 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:55,434 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:01:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:01:55,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:55,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:55,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-15 12:01:55,437 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-15 12:01:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:55,437 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:01:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:01:55,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:55,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:55,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:55,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 12:01:55,439 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-04-15 12:01:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:55,439 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 12:01:55,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 12:01:55,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:01:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:01:55,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:55,487 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:55,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:55,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 12:01:55,695 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 5 times [2022-04-15 12:01:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:55,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4336971] [2022-04-15 12:01:55,701 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:55,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 6 times [2022-04-15 12:01:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:55,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308814274] [2022-04-15 12:01:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:55,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {1117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1108#true} is VALID [2022-04-15 12:01:55,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-15 12:01:55,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1108#true} {1108#true} #67#return; {1108#true} is VALID [2022-04-15 12:01:55,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:55,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1108#true} is VALID [2022-04-15 12:01:55,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-15 12:01:55,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #67#return; {1108#true} is VALID [2022-04-15 12:01:55,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret13 := main(); {1108#true} is VALID [2022-04-15 12:01:55,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1113#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:55,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1113#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1113#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:55,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1114#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} is VALID [2022-04-15 12:01:55,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {1114#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1114#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} is VALID [2022-04-15 12:01:55,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {1114#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1115#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} is VALID [2022-04-15 12:01:55,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1115#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} is VALID [2022-04-15 12:01:55,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1116#(and (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~max~0))} is VALID [2022-04-15 12:01:55,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {1116#(and (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1109#false} is VALID [2022-04-15 12:01:55,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {1109#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1109#false} is VALID [2022-04-15 12:01:55,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {1109#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1109#false} is VALID [2022-04-15 12:01:55,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {1109#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1109#false} is VALID [2022-04-15 12:01:55,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#false} assume !(~i~0 >= 0); {1109#false} is VALID [2022-04-15 12:01:55,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {1109#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1109#false} is VALID [2022-04-15 12:01:55,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {1109#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1109#false} is VALID [2022-04-15 12:01:55,965 INFO L272 TraceCheckUtils]: 19: Hoare triple {1109#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1109#false} is VALID [2022-04-15 12:01:55,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {1109#false} ~cond := #in~cond; {1109#false} is VALID [2022-04-15 12:01:55,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {1109#false} assume 0 == ~cond; {1109#false} is VALID [2022-04-15 12:01:55,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-04-15 12:01:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:55,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308814274] [2022-04-15 12:01:55,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308814274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:55,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404783140] [2022-04-15 12:01:55,967 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:55,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:55,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:56,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:01:56,078 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:01:56,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:56,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:01:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:56,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:56,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:01:56,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-04-15 12:01:56,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:56,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-04-15 12:01:57,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:57,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:57,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2022-04-15 12:01:57,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2022-04-15 12:01:57,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1108#true} is VALID [2022-04-15 12:01:57,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-15 12:01:57,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #67#return; {1108#true} is VALID [2022-04-15 12:01:57,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret13 := main(); {1108#true} is VALID [2022-04-15 12:01:57,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1161#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:01:57,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {1161#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1165#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1169#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:57,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {1173#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:01:57,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1177#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:57,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1181#(and (= |main_#t~mem11| |main_#t~mem10|) (= |main_#t~mem11| 0))} is VALID [2022-04-15 12:01:57,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {1181#(and (= |main_#t~mem11| |main_#t~mem10|) (= |main_#t~mem11| 0))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:57,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:57,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {1189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1109#false} is VALID [2022-04-15 12:01:57,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-04-15 12:01:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:01:57,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:57,893 INFO L356 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2022-04-15 12:01:57,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 498 treesize of output 1 [2022-04-15 12:01:57,976 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-15 12:01:58,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-04-15 12:01:58,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {1189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1109#false} is VALID [2022-04-15 12:01:58,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:58,004 INFO L272 TraceCheckUtils]: 19: Hoare triple {1205#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:58,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {1209#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1205#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:01:58,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1209#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:58,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {1213#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:01:58,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1221#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1217#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:01:58,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1221#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {1108#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1225#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {1108#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {1108#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {1108#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {1108#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1108#true} is VALID [2022-04-15 12:01:58,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1108#true} is VALID [2022-04-15 12:01:58,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret13 := main(); {1108#true} is VALID [2022-04-15 12:01:58,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #67#return; {1108#true} is VALID [2022-04-15 12:01:58,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-15 12:01:58,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1108#true} is VALID [2022-04-15 12:01:58,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2022-04-15 12:01:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:01:58,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404783140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:58,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:58,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 22 [2022-04-15 12:01:58,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:58,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4336971] [2022-04-15 12:01:58,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4336971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:58,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:58,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:01:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757769625] [2022-04-15 12:01:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:01:58,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:58,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:58,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:58,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:01:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:01:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:01:58,044 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:58,415 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:01:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:01:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:01:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 12:01:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 12:01:58,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-15 12:01:58,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:58,473 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:01:58,473 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:01:58,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:01:58,474 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:58,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:01:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-15 12:01:58,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:58,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:58,526 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:58,526 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:58,528 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:01:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:01:58,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:58,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:58,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-04-15 12:01:58,529 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-04-15 12:01:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:58,532 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:01:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:01:58,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:58,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:58,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:58,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 12:01:58,533 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-04-15 12:01:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:58,534 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 12:01:58,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:58,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 12:01:58,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:01:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:01:58,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:58,580 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:58,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:58,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:58,786 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:58,787 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 7 times [2022-04-15 12:01:58,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:58,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022530454] [2022-04-15 12:01:58,791 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:58,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 8 times [2022-04-15 12:01:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:58,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493831583] [2022-04-15 12:01:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:59,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-15 12:01:59,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-15 12:01:59,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1492#true} {1492#true} #67#return; {1492#true} is VALID [2022-04-15 12:01:59,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:59,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-15 12:01:59,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-15 12:01:59,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #67#return; {1492#true} is VALID [2022-04-15 12:01:59,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret13 := main(); {1492#true} is VALID [2022-04-15 12:01:59,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1497#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:59,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {1497#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1497#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 12:01:59,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {1497#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1498#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} is VALID [2022-04-15 12:01:59,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {1498#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1498#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} is VALID [2022-04-15 12:01:59,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {1498#(and (<= (+ main_~i~0 4) main_~max~0) (<= (+ (* (div main_~max~0 4294967296) 4294967296) 1) main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1499#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} is VALID [2022-04-15 12:01:59,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1499#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} is VALID [2022-04-15 12:01:59,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#(and (<= (+ main_~i~0 3) main_~max~0) (<= (+ 2 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1500#(and (<= (+ 3 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~i~0 2) main_~max~0))} is VALID [2022-04-15 12:01:59,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1500#(and (<= (+ 3 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~i~0 2) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1500#(and (<= (+ 3 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~i~0 2) main_~max~0))} is VALID [2022-04-15 12:01:59,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1500#(and (<= (+ 3 (* (div main_~max~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~i~0 2) main_~max~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1501#(and (<= (+ main_~i~0 1) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1501#(and (<= (+ main_~i~0 1) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1493#false} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {1493#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1493#false} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1493#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1493#false} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {1493#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1493#false} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1493#false} assume !(~i~0 >= 0); {1493#false} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1493#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1493#false} is VALID [2022-04-15 12:01:59,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {1493#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1493#false} is VALID [2022-04-15 12:01:59,046 INFO L272 TraceCheckUtils]: 21: Hoare triple {1493#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1493#false} is VALID [2022-04-15 12:01:59,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {1493#false} ~cond := #in~cond; {1493#false} is VALID [2022-04-15 12:01:59,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#false} assume 0 == ~cond; {1493#false} is VALID [2022-04-15 12:01:59,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-15 12:01:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:59,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493831583] [2022-04-15 12:01:59,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493831583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:59,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585890166] [2022-04-15 12:01:59,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:59,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:59,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:59,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:59,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:01:59,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:59,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:59,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:01:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:59,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:59,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:01:59,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-04-15 12:01:59,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:59,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-04-15 12:02:00,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:00,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:00,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2022-04-15 12:02:00,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2022-04-15 12:02:00,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-15 12:02:00,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-15 12:02:00,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #67#return; {1492#true} is VALID [2022-04-15 12:02:00,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret13 := main(); {1492#true} is VALID [2022-04-15 12:02:00,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1552#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:00,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {1552#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1556#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {1556#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1560#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:00,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {1560#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {1564#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:00,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {1564#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1568#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:02:00,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {1568#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1572#(and (= |main_#t~mem11| |main_#t~mem10|) (= |main_#t~mem10| 0))} is VALID [2022-04-15 12:02:00,405 INFO L272 TraceCheckUtils]: 21: Hoare triple {1572#(and (= |main_#t~mem11| |main_#t~mem10|) (= |main_#t~mem10| 0))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:00,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1580#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:00,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {1580#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1493#false} is VALID [2022-04-15 12:02:00,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-15 12:02:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:02:00,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:00,958 INFO L356 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2022-04-15 12:02:00,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 498 treesize of output 1 [2022-04-15 12:02:01,023 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-15 12:02:01,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-15 12:02:01,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {1580#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1493#false} is VALID [2022-04-15 12:02:01,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1580#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:01,059 INFO L272 TraceCheckUtils]: 21: Hoare triple {1596#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:01,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {1600#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1596#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:01,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {1604#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1600#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:01,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {1608#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {1604#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:01,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1608#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:02:01,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1616#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1612#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:01,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1616#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:01,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1492#true} is VALID [2022-04-15 12:02:01,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-15 12:02:01,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1492#true} is VALID [2022-04-15 12:02:01,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-15 12:02:01,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {1492#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1492#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {1492#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {1492#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret13 := main(); {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #67#return; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-15 12:02:01,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2022-04-15 12:02:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:02:01,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585890166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:01,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:01,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 23 [2022-04-15 12:02:01,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022530454] [2022-04-15 12:02:01,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022530454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:01,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:01,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:02:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581130425] [2022-04-15 12:02:01,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:02:01,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:01,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:01,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:01,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:02:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:02:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:02:01,107 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:01,549 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 12:02:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:02:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:02:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-15 12:02:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-15 12:02:01,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2022-04-15 12:02:01,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:01,633 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:02:01,633 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:02:01,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:02:01,634 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:01,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:02:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:02:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 12:02:01,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:01,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:01,689 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:01,690 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:01,691 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:02:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:02:01,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:01,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:01,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 12:02:01,691 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 12:02:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:01,692 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:02:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:02:01,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:01,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:01,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:01,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 12:02:01,694 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2022-04-15 12:02:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:01,694 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 12:02:01,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:01,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 12:02:01,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:02:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:02:01,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:01,747 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:01,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:01,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:01,955 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 9 times [2022-04-15 12:02:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:01,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970824852] [2022-04-15 12:02:01,964 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:01,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 10 times [2022-04-15 12:02:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575734790] [2022-04-15 12:02:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:02,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1903#true} is VALID [2022-04-15 12:02:02,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1903#true} assume true; {1903#true} is VALID [2022-04-15 12:02:02,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1903#true} {1903#true} #67#return; {1903#true} is VALID [2022-04-15 12:02:02,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {1903#true} call ULTIMATE.init(); {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:02,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1903#true} is VALID [2022-04-15 12:02:02,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1903#true} assume true; {1903#true} is VALID [2022-04-15 12:02:02,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1903#true} {1903#true} #67#return; {1903#true} is VALID [2022-04-15 12:02:02,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1903#true} call #t~ret13 := main(); {1903#true} is VALID [2022-04-15 12:02:02,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {1903#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:02,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {1908#(and (<= 5 main_~max~0) (<= main_~max~0 5))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1909#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:02,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {1909#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1909#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:02,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {1909#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1910#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:02,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {1910#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {1904#false} is VALID [2022-04-15 12:02:02,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {1904#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1904#false} is VALID [2022-04-15 12:02:02,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {1904#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1904#false} is VALID [2022-04-15 12:02:02,237 INFO L272 TraceCheckUtils]: 23: Hoare triple {1904#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1904#false} is VALID [2022-04-15 12:02:02,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#false} ~cond := #in~cond; {1904#false} is VALID [2022-04-15 12:02:02,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {1904#false} assume 0 == ~cond; {1904#false} is VALID [2022-04-15 12:02:02,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {1904#false} assume !false; {1904#false} is VALID [2022-04-15 12:02:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:02,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575734790] [2022-04-15 12:02:02,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575734790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:02,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043747346] [2022-04-15 12:02:02,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:02,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:02,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:02,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:02,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:02:02,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:02,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:02,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:02:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:02,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:02,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:02,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 12:02:03,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:03,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:03,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 12:02:03,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {1903#true} call ULTIMATE.init(); {1903#true} is VALID [2022-04-15 12:02:03,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {1903#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1903#true} is VALID [2022-04-15 12:02:03,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {1903#true} assume true; {1903#true} is VALID [2022-04-15 12:02:03,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1903#true} {1903#true} #67#return; {1903#true} is VALID [2022-04-15 12:02:03,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {1903#true} call #t~ret13 := main(); {1903#true} is VALID [2022-04-15 12:02:03,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {1903#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1967#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:03,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {1967#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1971#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {1971#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1975#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {1975#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {1979#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:03,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {1979#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1983#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:02:03,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1983#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1987#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:03,345 INFO L272 TraceCheckUtils]: 23: Hoare triple {1987#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1991#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:03,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {1991#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1995#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:03,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1995#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1904#false} is VALID [2022-04-15 12:02:03,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {1904#false} assume !false; {1904#false} is VALID [2022-04-15 12:02:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:03,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:03,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:03,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:02:03,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 12:02:03,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:02:03,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 12:02:03,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,750 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:02:03,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-04-15 12:02:03,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2022-04-15 12:02:03,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,841 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:02:03,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 84 [2022-04-15 12:02:03,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:03,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:02:03,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,962 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:02:03,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2022-04-15 12:02:03,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:03,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:02:03,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:02:04,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:04,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:02:04,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:02:04,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:04,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-04-15 12:02:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:04,081 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:02:04,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 79 [2022-04-15 12:02:04,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {1904#false} assume !false; {1904#false} is VALID [2022-04-15 12:02:04,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {1995#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1904#false} is VALID [2022-04-15 12:02:04,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {1991#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1995#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:04,495 INFO L272 TraceCheckUtils]: 23: Hoare triple {1987#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1991#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:04,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {2014#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1987#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:04,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {2018#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2014#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:04,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {2022#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {2018#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:04,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2022#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:02:04,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {2030#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2026#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {1903#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2030#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {1903#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1903#true} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {1903#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1903#true} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {1903#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1903#true} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {1903#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1903#true} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {1903#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1903#true} is VALID [2022-04-15 12:02:04,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1903#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {1903#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1903#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1903#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1903#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {1903#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1903#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1903#true} call #t~ret13 := main(); {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1903#true} {1903#true} #67#return; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1903#true} assume true; {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1903#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1903#true} is VALID [2022-04-15 12:02:04,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1903#true} call ULTIMATE.init(); {1903#true} is VALID [2022-04-15 12:02:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:04,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043747346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:04,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:04,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 20 [2022-04-15 12:02:04,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:04,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970824852] [2022-04-15 12:02:04,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970824852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:04,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:04,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:02:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766631365] [2022-04-15 12:02:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:02:04,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:04,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:04,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:02:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:02:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:02:04,531 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:04,760 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 12:02:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:02:04,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:02:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 12:02:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 12:02:04,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 12:02:04,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:04,819 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:02:04,819 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:02:04,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:02:04,820 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:04,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:02:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:02:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 12:02:04,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:04,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:04,887 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:04,887 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:04,890 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:02:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:02:04,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:04,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:04,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 12:02:04,890 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 12:02:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:04,891 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:02:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:02:04,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:04,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:04,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:04,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-15 12:02:04,894 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2022-04-15 12:02:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:04,894 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-15 12:02:04,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2022-04-15 12:02:04,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 12:02:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:02:04,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:04,952 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:04,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:05,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:05,153 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 11 times [2022-04-15 12:02:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:05,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841759110] [2022-04-15 12:02:05,159 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:05,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 12 times [2022-04-15 12:02:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:05,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949455333] [2022-04-15 12:02:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:05,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {2333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2323#true} is VALID [2022-04-15 12:02:05,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-04-15 12:02:05,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2323#true} {2323#true} #67#return; {2323#true} is VALID [2022-04-15 12:02:05,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {2323#true} call ULTIMATE.init(); {2333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:05,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2323#true} is VALID [2022-04-15 12:02:05,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-04-15 12:02:05,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2323#true} {2323#true} #67#return; {2323#true} is VALID [2022-04-15 12:02:05,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {2323#true} call #t~ret13 := main(); {2323#true} is VALID [2022-04-15 12:02:05,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {2323#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:05,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {2328#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2329#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:05,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {2329#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2329#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:05,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {2329#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2330#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:05,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {2330#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2331#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:05,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {2331#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2332#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:05,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {2332#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {2324#false} is VALID [2022-04-15 12:02:05,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {2324#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2324#false} is VALID [2022-04-15 12:02:05,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {2324#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2324#false} is VALID [2022-04-15 12:02:05,420 INFO L272 TraceCheckUtils]: 25: Hoare triple {2324#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2324#false} is VALID [2022-04-15 12:02:05,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-04-15 12:02:05,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {2324#false} assume 0 == ~cond; {2324#false} is VALID [2022-04-15 12:02:05,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-04-15 12:02:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:05,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949455333] [2022-04-15 12:02:05,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949455333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:05,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247525099] [2022-04-15 12:02:05,421 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:05,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:05,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:05,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:02:05,610 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:02:05,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:05,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:02:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:05,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:05,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:06,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 12:02:08,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:08,243 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-04-15 12:02:08,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-04-15 12:02:08,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {2323#true} call ULTIMATE.init(); {2323#true} is VALID [2022-04-15 12:02:08,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2323#true} is VALID [2022-04-15 12:02:08,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-04-15 12:02:08,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2323#true} {2323#true} #67#return; {2323#true} is VALID [2022-04-15 12:02:08,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {2323#true} call #t~ret13 := main(); {2323#true} is VALID [2022-04-15 12:02:08,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {2323#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {2352#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2389#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:08,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2393#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:08,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {2393#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2397#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:08,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {2397#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2401#(and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))} is VALID [2022-04-15 12:02:08,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {2401#(and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2405#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:08,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {2405#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {2409#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:08,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {2409#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2413#(and (< (div (+ (- 1) main_~j~0) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 1) 4294967296) 1)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))} is VALID [2022-04-15 12:02:08,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {2413#(and (< (div (+ (- 1) main_~j~0) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 1) 4294967296) 1)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2417#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:08,858 INFO L272 TraceCheckUtils]: 25: Hoare triple {2417#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:08,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:08,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2324#false} is VALID [2022-04-15 12:02:08,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-04-15 12:02:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:08,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:09,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:09,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:02:09,323 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-04-15 12:02:09,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-15 12:02:09,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:02:09,374 INFO L356 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2022-04-15 12:02:09,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 47 [2022-04-15 12:02:09,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:09,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:02:09,542 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-04-15 12:02:09,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 12:02:09,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:02:09,595 INFO L356 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-04-15 12:02:09,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2022-04-15 12:02:09,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-04-15 12:02:09,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2324#false} is VALID [2022-04-15 12:02:09,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:09,969 INFO L272 TraceCheckUtils]: 25: Hoare triple {2417#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:09,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {2444#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2417#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:09,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {2448#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2444#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:09,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {2452#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {2448#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:09,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {2456#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2452#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:02:09,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {2460#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2456#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:09,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {2464#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2460#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:09,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {2468#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2464#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2468#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {2323#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {2323#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {2323#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {2323#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {2323#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {2323#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2323#true} is VALID [2022-04-15 12:02:09,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {2323#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2323#true} is VALID [2022-04-15 12:02:09,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {2323#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2323#true} is VALID [2022-04-15 12:02:09,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {2323#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {2323#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {2323#true} call #t~ret13 := main(); {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2323#true} {2323#true} #67#return; {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {2323#true} call ULTIMATE.init(); {2323#true} is VALID [2022-04-15 12:02:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:09,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247525099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:09,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 26 [2022-04-15 12:02:09,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:09,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841759110] [2022-04-15 12:02:09,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841759110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:09,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:02:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332966874] [2022-04-15 12:02:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:02:09,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:09,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:10,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:10,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:02:10,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:10,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:02:10,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:02:10,014 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:10,490 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-04-15 12:02:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:02:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:02:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 12:02:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 12:02:10,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 12:02:10,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:10,537 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:02:10,537 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:02:10,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:02:10,538 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:10,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 38 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:02:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:02:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-15 12:02:12,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:12,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:12,560 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:12,561 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,563 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:02:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:02:12,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:12,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:12,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-15 12:02:12,565 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-15 12:02:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,566 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:02:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:02:12,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:12,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:12,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:12,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 12:02:12,582 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2022-04-15 12:02:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:12,583 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 12:02:12,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 12:02:12,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:02:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:02:12,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:12,747 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:12,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 12:02:12,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:12,956 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 13 times [2022-04-15 12:02:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:12,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259841796] [2022-04-15 12:02:12,973 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:12,973 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 14 times [2022-04-15 12:02:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:12,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166423794] [2022-04-15 12:02:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:13,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:13,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {2788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2777#true} is VALID [2022-04-15 12:02:13,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 12:02:13,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2777#true} {2777#true} #67#return; {2777#true} is VALID [2022-04-15 12:02:13,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:13,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {2788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2777#true} is VALID [2022-04-15 12:02:13,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 12:02:13,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2777#true} {2777#true} #67#return; {2777#true} is VALID [2022-04-15 12:02:13,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {2777#true} call #t~ret13 := main(); {2777#true} is VALID [2022-04-15 12:02:13,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {2777#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:13,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {2782#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2783#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:13,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {2783#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2783#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:13,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {2783#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2784#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:13,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {2784#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2784#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:13,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {2784#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2785#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} is VALID [2022-04-15 12:02:13,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {2785#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2786#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:13,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {2786#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:13,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {2787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {2778#false} is VALID [2022-04-15 12:02:13,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {2778#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2778#false} is VALID [2022-04-15 12:02:13,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {2778#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2778#false} is VALID [2022-04-15 12:02:13,314 INFO L272 TraceCheckUtils]: 27: Hoare triple {2778#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2778#false} is VALID [2022-04-15 12:02:13,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-15 12:02:13,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-15 12:02:13,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-15 12:02:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166423794] [2022-04-15 12:02:13,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166423794] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904728329] [2022-04-15 12:02:13,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:13,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:13,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:02:13,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:13,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:13,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:02:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:13,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:13,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:14,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 12:02:16,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:16,462 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 12:02:16,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 13 [2022-04-15 12:02:16,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-15 12:02:16,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2777#true} is VALID [2022-04-15 12:02:16,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 12:02:16,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2777#true} {2777#true} #67#return; {2777#true} is VALID [2022-04-15 12:02:16,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {2777#true} call #t~ret13 := main(); {2777#true} is VALID [2022-04-15 12:02:16,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {2777#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {2807#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2844#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:16,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {2844#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2848#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:16,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {2848#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2852#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2856#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {2856#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2860#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {2860#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2864#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2868#(and (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-15 12:02:16,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {2868#(and (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)))} assume !(~i~0 >= 0); {2872#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 3) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:16,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {2872#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 3) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2876#(and (< (div (+ (- 2) main_~j~0) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 2 (* (- 1) main_~j~0)) 4294967296) 1)) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod main_~j~0 4294967296) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:16,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {2876#(and (< (div (+ (- 2) main_~j~0) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 2 (* (- 1) main_~j~0)) 4294967296) 1)) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod main_~j~0 4294967296) |main_~#str1~0.offset|))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2880#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:16,956 INFO L272 TraceCheckUtils]: 27: Hoare triple {2880#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2884#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:16,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {2884#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2888#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:16,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {2888#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2778#false} is VALID [2022-04-15 12:02:16,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-15 12:02:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:16,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:17,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:17,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:02:17,309 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:02:17,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-04-15 12:02:17,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-04-15 12:02:17,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:02:17,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:17,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:02:17,441 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:02:17,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-04-15 12:02:17,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-04-15 12:02:17,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:02:17,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-15 12:02:17,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {2888#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2778#false} is VALID [2022-04-15 12:02:17,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {2884#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2888#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:17,824 INFO L272 TraceCheckUtils]: 27: Hoare triple {2880#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2884#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:17,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {2907#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2880#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:17,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {2911#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2907#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:17,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {2911#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:17,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {2919#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2915#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:02:17,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {2923#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2919#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:17,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {2927#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2923#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:17,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {2931#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2927#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:17,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {2935#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2931#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:17,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {2939#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2935#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {2777#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2939#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {2777#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {2777#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {2777#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {2777#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {2777#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {2777#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {2777#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2777#true} is VALID [2022-04-15 12:02:17,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {2777#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {2777#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {2777#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {2777#true} call #t~ret13 := main(); {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2777#true} {2777#true} #67#return; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-15 12:02:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904728329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:17,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:17,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 31 [2022-04-15 12:02:17,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259841796] [2022-04-15 12:02:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259841796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:17,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:17,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:02:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803503353] [2022-04-15 12:02:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:17,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:02:17,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:17,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:17,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:02:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:02:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:02:17,854 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:18,362 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-04-15 12:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:02:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:02:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 12:02:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 12:02:18,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 12:02:18,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:18,399 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:02:18,400 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:02:18,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:02:18,404 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:18,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 48 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:02:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:02:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-15 12:02:18,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:18,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:18,465 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:18,467 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:18,468 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:02:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:02:18,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:18,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:18,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 12:02:18,469 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 12:02:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:18,469 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:02:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:02:18,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:18,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:18,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:18,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 12:02:18,471 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2022-04-15 12:02:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:18,473 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 12:02:18,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:18,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 12:02:18,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:02:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:02:18,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:18,521 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:18,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:18,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:18,736 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 15 times [2022-04-15 12:02:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:18,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418231118] [2022-04-15 12:02:18,740 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:18,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 16 times [2022-04-15 12:02:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:18,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756268488] [2022-04-15 12:02:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:18,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {3274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3262#true} is VALID [2022-04-15 12:02:18,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3262#true} assume true; {3262#true} is VALID [2022-04-15 12:02:18,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3262#true} {3262#true} #67#return; {3262#true} is VALID [2022-04-15 12:02:18,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {3262#true} call ULTIMATE.init(); {3274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:18,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {3274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3262#true} is VALID [2022-04-15 12:02:18,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {3262#true} assume true; {3262#true} is VALID [2022-04-15 12:02:18,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3262#true} {3262#true} #67#return; {3262#true} is VALID [2022-04-15 12:02:18,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {3262#true} call #t~ret13 := main(); {3262#true} is VALID [2022-04-15 12:02:18,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {3262#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 12:02:18,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {3267#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {3268#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:18,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {3268#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3268#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:18,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {3268#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3269#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:18,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {3269#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3269#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:18,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {3269#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3270#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} is VALID [2022-04-15 12:02:18,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {3270#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3270#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} is VALID [2022-04-15 12:02:18,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {3270#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3271#(or (<= (+ main_~i~0 4) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:18,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {3271#(or (<= (+ main_~i~0 4) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3272#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:18,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {3272#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3273#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:02:18,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {3273#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {3263#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {3263#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L272 TraceCheckUtils]: 29: Hoare triple {3263#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {3263#false} ~cond := #in~cond; {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {3263#false} assume 0 == ~cond; {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {3263#false} assume !false; {3263#false} is VALID [2022-04-15 12:02:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:18,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756268488] [2022-04-15 12:02:18,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756268488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:18,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573038559] [2022-04-15 12:02:18,990 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:18,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:18,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:18,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:02:19,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:19,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:19,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:02:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:19,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:19,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:19,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 12:02:20,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:20,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:20,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 10 [2022-04-15 12:02:20,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {3262#true} call ULTIMATE.init(); {3262#true} is VALID [2022-04-15 12:02:20,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {3262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3262#true} is VALID [2022-04-15 12:02:20,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {3262#true} assume true; {3262#true} is VALID [2022-04-15 12:02:20,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3262#true} {3262#true} #67#return; {3262#true} is VALID [2022-04-15 12:02:20,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {3262#true} call #t~ret13 := main(); {3262#true} is VALID [2022-04-15 12:02:20,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {3262#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {3330#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:20,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {3330#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3334#(and (= |main_~#str2~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:20,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {3334#(and (= |main_~#str2~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3338#(and (= |main_~#str2~0.offset| 0) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {3338#(and (= |main_~#str2~0.offset| 0) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3342#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {3342#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3346#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {3346#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3350#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 3) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {3350#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 3) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3354#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:20,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {3354#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3358#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:20,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {3358#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3362#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4)) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {3362#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4)) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {3366#(and (= |main_~#str2~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {3366#(and (= |main_~#str2~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3370#(and (= |main_~#str2~0.offset| 0) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (<= 3 (mod main_~j~0 4294967296)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 3) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:20,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {3370#(and (= |main_~#str2~0.offset| 0) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (<= 3 (mod main_~j~0 4294967296)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 3) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3374#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:20,944 INFO L272 TraceCheckUtils]: 29: Hoare triple {3374#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:20,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {3378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:20,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {3382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3263#false} is VALID [2022-04-15 12:02:20,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {3263#false} assume !false; {3263#false} is VALID [2022-04-15 12:02:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:20,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:21,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:21,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:02:21,267 INFO L356 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-04-15 12:02:21,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 101 [2022-04-15 12:02:21,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 12:02:21,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:02:21,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:21,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:02:21,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:02:21,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:02:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,440 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:02:21,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2022-04-15 12:02:21,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 12:02:21,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-04-15 12:02:21,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:21,506 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 12:02:21,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 79 [2022-04-15 12:02:22,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {3263#false} assume !false; {3263#false} is VALID [2022-04-15 12:02:22,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {3382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3263#false} is VALID [2022-04-15 12:02:22,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {3378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:22,547 INFO L272 TraceCheckUtils]: 29: Hoare triple {3374#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:22,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {3401#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3374#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:22,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {3405#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3401#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:22,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {3409#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {3405#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:22,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {3413#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3409#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:02:22,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {3417#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3413#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:22,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {3421#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3417#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:22,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {3425#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3421#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:22,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {3429#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3425#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:22,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3429#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:22,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {3437#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 (- 3) |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3433#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:22,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {3441#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 (- 3) |main_~#str1~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3437#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 (- 3) |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:22,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {3262#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {3441#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 (- 3) |main_~#str1~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= (+ |main_~#str1~0.offset| 4294967296) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:22,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {3262#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3262#true} is VALID [2022-04-15 12:02:22,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {3262#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3262#true} is VALID [2022-04-15 12:02:22,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {3262#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3262#true} is VALID [2022-04-15 12:02:22,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {3262#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {3262#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {3262#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {3262#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {3262#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {3262#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {3262#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {3262#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {3262#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {3262#true} call #t~ret13 := main(); {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3262#true} {3262#true} #67#return; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {3262#true} assume true; {3262#true} is VALID [2022-04-15 12:02:22,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {3262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3262#true} is VALID [2022-04-15 12:02:22,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {3262#true} call ULTIMATE.init(); {3262#true} is VALID [2022-04-15 12:02:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:22,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573038559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:22,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:22,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 16] total 36 [2022-04-15 12:02:22,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418231118] [2022-04-15 12:02:22,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418231118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:22,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:22,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:02:22,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271170290] [2022-04-15 12:02:22,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:02:22,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:22,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:22,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:22,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:02:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:02:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:02:22,586 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:23,426 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-15 12:02:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:02:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:02:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-15 12:02:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-15 12:02:23,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-04-15 12:02:23,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:23,534 INFO L225 Difference]: With dead ends: 63 [2022-04-15 12:02:23,534 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 12:02:23,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:02:23,540 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 54 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:23,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 52 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:02:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 12:02:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-04-15 12:02:23,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:23,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:23,669 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:23,670 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:23,688 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 12:02:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 12:02:23,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:23,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:23,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 52 states. [2022-04-15 12:02:23,689 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 52 states. [2022-04-15 12:02:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:23,695 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 12:02:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 12:02:23,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:23,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:23,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:23,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-15 12:02:23,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2022-04-15 12:02:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:23,697 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-15 12:02:23,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:23,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-15 12:02:23,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 12:02:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:02:23,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:23,768 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:23,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:23,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:02:23,987 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 17 times [2022-04-15 12:02:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:23,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926772824] [2022-04-15 12:02:23,995 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:23,995 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 18 times [2022-04-15 12:02:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:23,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247337045] [2022-04-15 12:02:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:24,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-15 12:02:24,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-15 12:02:24,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3822#true} {3822#true} #67#return; {3822#true} is VALID [2022-04-15 12:02:24,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {3822#true} call ULTIMATE.init(); {3845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:24,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {3845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-15 12:02:24,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-15 12:02:24,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3822#true} {3822#true} #67#return; {3822#true} is VALID [2022-04-15 12:02:24,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {3822#true} call #t~ret13 := main(); {3822#true} is VALID [2022-04-15 12:02:24,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {3822#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {3827#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {3827#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3827#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {3827#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3828#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:24,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {3828#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3828#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:24,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {3828#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3829#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:24,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {3829#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3829#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:24,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {3829#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3830#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:24,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3830#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:24,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3831#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:24,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {3831#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3831#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:24,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3831#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3832#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {3832#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3832#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {3832#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {3833#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:24,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {3833#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3834#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 3 |main_~#str1~0.offset|) (+ |main_~#str1~0.offset| 4)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:24,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {3834#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 3 |main_~#str1~0.offset|) (+ |main_~#str1~0.offset| 4)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3835#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {3835#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3836#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {3836#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3835#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {3835#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3836#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {3836#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3835#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {3835#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3836#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {3836#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3837#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {3837#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3838#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {3838#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3839#(and (= |main_~#str2~0.offset| 0) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-15 12:02:24,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {3839#(and (= |main_~#str2~0.offset| 0) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)))} assume !(~i~0 >= 0); {3840#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {3840#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3841#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:24,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {3841#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3842#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:24,915 INFO L272 TraceCheckUtils]: 31: Hoare triple {3842#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3843#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:02:24,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {3843#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3844#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:02:24,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {3844#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3823#false} is VALID [2022-04-15 12:02:24,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {3823#false} assume !false; {3823#false} is VALID [2022-04-15 12:02:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:02:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247337045] [2022-04-15 12:02:24,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247337045] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556816183] [2022-04-15 12:02:24,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:24,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:24,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:24,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:02:25,275 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:02:25,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:25,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 12:02:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:25,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:25,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:25,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 12:02:27,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:02:27,682 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 12:02:27,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 13 [2022-04-15 12:02:28,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {3822#true} call ULTIMATE.init(); {3822#true} is VALID [2022-04-15 12:02:28,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-15 12:02:28,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-15 12:02:28,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3822#true} {3822#true} #67#return; {3822#true} is VALID [2022-04-15 12:02:28,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {3822#true} call #t~ret13 := main(); {3822#true} is VALID [2022-04-15 12:02:28,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {3822#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {3864#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {3864#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3864#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {3864#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3871#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {3871#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3871#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {3871#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3878#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {3878#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3878#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {3878#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3885#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {3885#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3885#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {3885#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {3892#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {3905#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:02:28,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {3905#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3909#(and (= main_~j~0 1) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {3909#(and (= main_~j~0 1) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3913#(and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (= main_~j~0 1) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {3913#(and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (= main_~j~0 1) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3917#(and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-15 12:02:28,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {3917#(and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3921#(and (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-15 12:02:28,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {3921#(and (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3925#(and (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {3925#(and (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3929#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 2)) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {3929#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 2)) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3933#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 2)) (= (+ main_~j~0 (- 3)) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {3933#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 2)) (= (+ main_~j~0 (- 3)) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3937#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 (- 3)) 1) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3)) (+ main_~i~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {3937#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 (- 3)) 1) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3)) (+ main_~i~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3941#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3)) (+ main_~i~0 1)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:28,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {3941#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3)) (+ main_~i~0 1)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3945#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~i~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:28,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {3945#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~i~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {3949#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 5) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:28,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {3949#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 5) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3953#(and (< (div main_~j~0 (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 12:02:28,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {3953#(and (< (div main_~j~0 (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3842#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:28,113 INFO L272 TraceCheckUtils]: 31: Hoare triple {3842#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3960#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:28,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {3960#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3964#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:28,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {3964#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3823#false} is VALID [2022-04-15 12:02:28,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {3823#false} assume !false; {3823#false} is VALID [2022-04-15 12:02:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:02:28,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:28,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:28,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 12:02:28,538 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-04-15 12:02:28,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-15 12:02:28,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 12:02:28,591 INFO L356 Elim1Store]: treesize reduction 27, result has 34.1 percent of original size [2022-04-15 12:02:28,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 45 [2022-04-15 12:02:28,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:28,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 12:02:28,735 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:02:28,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-04-15 12:02:28,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-04-15 12:02:28,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 12:02:29,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {3823#false} assume !false; {3823#false} is VALID [2022-04-15 12:02:29,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {3964#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3823#false} is VALID [2022-04-15 12:02:29,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {3960#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3964#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:29,429 INFO L272 TraceCheckUtils]: 31: Hoare triple {3842#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3960#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:29,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {3983#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3842#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:29,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3983#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:29,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {3991#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {3987#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:02:29,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {3995#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3991#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:02:29,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {3999#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3995#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:29,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {4003#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3999#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:29,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {4007#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4003#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:29,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {4011#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4007#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:29,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {4015#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4011#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:29,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {4019#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4015#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:29,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {4023#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4019#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:29,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {4027#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4023#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:29,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {4031#(or (< main_~i~0 4) (and (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))) (<= 5 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4027#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {3822#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {4031#(or (< main_~i~0 4) (and (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {3822#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {3822#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {3822#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {3822#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {3822#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {3822#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {3822#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {3822#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {3822#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {3822#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {3822#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3822#true} is VALID [2022-04-15 12:02:29,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {3822#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {3822#true} is VALID [2022-04-15 12:02:29,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {3822#true} call #t~ret13 := main(); {3822#true} is VALID [2022-04-15 12:02:29,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3822#true} {3822#true} #67#return; {3822#true} is VALID [2022-04-15 12:02:29,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-15 12:02:29,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-15 12:02:29,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {3822#true} call ULTIMATE.init(); {3822#true} is VALID [2022-04-15 12:02:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:29,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556816183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:29,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:29,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 18] total 54 [2022-04-15 12:02:29,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:29,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926772824] [2022-04-15 12:02:29,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926772824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:29,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:29,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:02:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650137351] [2022-04-15 12:02:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:02:29,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:29,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:29,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:29,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:02:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:02:29,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2504, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:02:29,481 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,547 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 12:02:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:02:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:02:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-15 12:02:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-15 12:02:33,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 70 transitions. [2022-04-15 12:02:33,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:33,654 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:02:33,654 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:02:33,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=849, Invalid=5471, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 12:02:33,656 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:33,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 45 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:02:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:02:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-04-15 12:02:33,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:33,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:02:33,842 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:02:33,842 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:02:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,849 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-04-15 12:02:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-04-15 12:02:33,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:33,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:33,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 68 states. [2022-04-15 12:02:33,853 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 68 states. [2022-04-15 12:02:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,863 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-04-15 12:02:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-04-15 12:02:33,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:33,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:33,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:33,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:02:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-04-15 12:02:33,866 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2022-04-15 12:02:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:33,866 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-04-15 12:02:33,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2022-04-15 12:02:33,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 12:02:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:02:33,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:33,948 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:34,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:34,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:34,149 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2022-04-15 12:02:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:34,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997013464] [2022-04-15 12:02:34,158 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:34,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 2 times [2022-04-15 12:02:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:34,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313252409] [2022-04-15 12:02:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:35,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:35,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {4541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4508#true} is VALID [2022-04-15 12:02:35,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:35,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4508#true} {4508#true} #67#return; {4508#true} is VALID [2022-04-15 12:02:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-15 12:02:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:35,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {4508#true} ~cond := #in~cond; {4508#true} is VALID [2022-04-15 12:02:35,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#true} assume !(0 == ~cond); {4508#true} is VALID [2022-04-15 12:02:35,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:35,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4508#true} {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {4508#true} call ULTIMATE.init(); {4541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:35,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {4541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4508#true} is VALID [2022-04-15 12:02:35,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:35,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4508#true} {4508#true} #67#return; {4508#true} is VALID [2022-04-15 12:02:35,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {4508#true} call #t~ret13 := main(); {4508#true} is VALID [2022-04-15 12:02:35,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {4508#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:35,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:35,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:35,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:35,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:35,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:35,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4517#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 4 main_~i~0)) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 4) (< (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967296))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= main_~i~0 4)))} is VALID [2022-04-15 12:02:35,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {4517#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 4 main_~i~0)) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 4) (< (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967296))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= main_~i~0 4)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4517#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 4 main_~i~0)) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 4) (< (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967296))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= main_~i~0 4)))} is VALID [2022-04-15 12:02:35,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {4517#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 4 main_~i~0)) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 4) (< (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967296))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= main_~i~0 4)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {4519#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:35,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {4519#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4520#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967292 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (and (<= 1 main_~j~0) (<= main_~j~0 1)) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967290 main_~max~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:35,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {4520#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967292 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (and (<= 1 main_~j~0) (<= main_~j~0 1)) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967290 main_~max~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4521#(and (= |main_~#str2~0.offset| 0) (or (and (<= 1 main_~j~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~j~0 1)) (<= main_~i~0 2) (<= 4 main_~i~0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {4521#(and (= |main_~#str2~0.offset| 0) (or (and (<= 1 main_~j~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~j~0 1)) (<= main_~i~0 2) (<= 4 main_~i~0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4522#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~j~0 2) (<= 2 main_~j~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= main_~i~0 2) (<= 4 main_~i~0)))} is VALID [2022-04-15 12:02:35,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {4522#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~j~0 2) (<= 2 main_~j~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= main_~i~0 2) (<= 4 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4523#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 1) (and (<= main_~j~0 2) (<= 2 main_~j~0) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= 3 main_~i~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {4523#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 1) (and (<= main_~j~0 2) (<= 2 main_~j~0) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= 3 main_~i~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4524#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 1) (<= 3 main_~i~0) (and (<= 3 main_~j~0) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~j~0 3) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {4524#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= main_~i~0 1) (<= 3 main_~i~0) (and (<= 3 main_~j~0) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~j~0 3) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4525#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 3 main_~j~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)) (<= main_~j~0 3)) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {4525#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 3 main_~j~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)) (<= main_~j~0 3)) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4526#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {4526#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4527#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0) (and (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0))) (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:35,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {4527#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0) (and (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0))) (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4528#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1))) (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:35,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {4528#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1))) (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4529#(and (= |main_~#str2~0.offset| 0) (or (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= 0 main_~i~0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {4529#(and (= |main_~#str2~0.offset| 0) (or (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= 0 main_~i~0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {4530#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {4530#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,914 INFO L272 TraceCheckUtils]: 31: Hoare triple {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4508#true} is VALID [2022-04-15 12:02:35,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {4508#true} ~cond := #in~cond; {4508#true} is VALID [2022-04-15 12:02:35,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {4508#true} assume !(0 == ~cond); {4508#true} is VALID [2022-04-15 12:02:35,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:35,961 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4508#true} {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:35,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {4531#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {4536#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 12:02:35,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {4536#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4537#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 12:02:35,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {4537#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4538#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:35,965 INFO L272 TraceCheckUtils]: 39: Hoare triple {4538#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4539#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:02:35,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {4539#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4540#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:02:35,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {4540#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4509#false} is VALID [2022-04-15 12:02:35,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {4509#false} assume !false; {4509#false} is VALID [2022-04-15 12:02:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313252409] [2022-04-15 12:02:35,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313252409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423130988] [2022-04-15 12:02:35,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:35,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:35,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:36,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:02:36,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:36,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:36,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:02:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:36,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:36,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:36,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-04-15 12:02:36,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:36,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-04-15 12:02:41,336 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1)))) is different from true [2022-04-15 12:02:42,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-04-15 12:02:42,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {4508#true} call ULTIMATE.init(); {4508#true} is VALID [2022-04-15 12:02:42,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4508#true} is VALID [2022-04-15 12:02:42,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:42,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4508#true} {4508#true} #67#return; {4508#true} is VALID [2022-04-15 12:02:42,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {4508#true} call #t~ret13 := main(); {4508#true} is VALID [2022-04-15 12:02:42,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {4508#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:42,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:42,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:42,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:42,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {4515#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:42,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:42,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {4516#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {4519#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:42,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {4519#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4599#(and (= |main_~#str2~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:42,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {4599#(and (= |main_~#str2~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4603#(and (= |main_~#str2~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {4603#(and (= |main_~#str2~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4607#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {4607#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4611#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:42,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {4611#(and (= |main_~#str2~0.offset| 0) (= (+ (- 2) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4615#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 3)) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:02:42,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {4615#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 3)) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4619#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 3)) 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {4619#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 3)) 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4623#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 4)) 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 4)) 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4627#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 4)) 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 5)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#(and (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 (- 4)) 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 5)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4631#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {4631#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4635#(and (= |main_~#str2~0.offset| 0) (= (+ (* (- 1) main_~i~0) 4294967290 (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-15 12:02:42,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {4635#(and (= |main_~#str2~0.offset| 0) (= (+ (* (- 1) main_~i~0) 4294967290 (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)))} assume !(~i~0 >= 0); {4530#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:42,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {4530#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:02:42,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:02:42,282 INFO L272 TraceCheckUtils]: 31: Hoare triple {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 12:02:42,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 12:02:42,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} assume !(0 == ~cond); {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 12:02:42,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} assume true; {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 12:02:42,285 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4649#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #65#return; {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:02:42,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {4642#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {4536#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 12:02:42,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {4536#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4537#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 12:02:42,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {4537#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4538#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:42,288 INFO L272 TraceCheckUtils]: 39: Hoare triple {4538#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:42,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {4674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:42,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {4678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4509#false} is VALID [2022-04-15 12:02:42,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {4509#false} assume !false; {4509#false} is VALID [2022-04-15 12:02:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-04-15 12:02:42,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:43,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:43,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 12:02:43,448 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-04-15 12:02:43,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2022-04-15 12:02:43,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 218 [2022-04-15 12:02:43,587 INFO L356 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2022-04-15 12:02:43,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 515 treesize of output 447 [2022-04-15 12:02:44,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:44,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 12:02:44,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:44,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-04-15 12:02:44,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2022-04-15 12:02:44,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:02:44,385 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:02:44,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 222 [2022-04-15 12:02:46,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {4509#false} assume !false; {4509#false} is VALID [2022-04-15 12:02:46,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {4678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4509#false} is VALID [2022-04-15 12:02:46,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {4674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:46,970 INFO L272 TraceCheckUtils]: 39: Hoare triple {4538#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:46,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {4697#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4538#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:02:46,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {4701#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4697#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:02:46,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {4701#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:02:46,973 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4508#true} {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} #65#return; {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:02:46,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:46,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {4508#true} assume !(0 == ~cond); {4508#true} is VALID [2022-04-15 12:02:46,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {4508#true} ~cond := #in~cond; {4508#true} is VALID [2022-04-15 12:02:46,973 INFO L272 TraceCheckUtils]: 31: Hoare triple {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4508#true} is VALID [2022-04-15 12:02:46,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:02:46,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {4727#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {4705#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:02:46,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {4731#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} assume !(~i~0 >= 0); {4727#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} is VALID [2022-04-15 12:02:46,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {4735#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4731#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 12:02:46,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {4739#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4735#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 12:02:46,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {4743#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4739#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:46,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {4747#(or (<= 2 main_~i~0) (and (or (and (or (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))) (= (+ main_~i~0 |main_~#str1~0.offset| 4294967297) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4743#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_450 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_450)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:46,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {4751#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296))) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4747#(or (<= 2 main_~i~0) (and (or (and (or (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))) (= (+ main_~i~0 |main_~#str1~0.offset| 4294967297) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:02:46,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {4755#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298))))))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4751#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296))) (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:46,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {4759#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967295 |main_~#str1~0.offset|)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4755#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298))))))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:02:46,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {4763#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967295 |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4759#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967295 |main_~#str1~0.offset|)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 12:02:46,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {4767#(or (and (or (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967294 |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))))))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4763#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967295 |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:46,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {4771#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967294 |main_~#str1~0.offset|))) (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4767#(or (and (or (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967294 |main_~#str1~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))))))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:46,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {4771#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 4294967294 |main_~#str1~0.offset|))) (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 12:02:46,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {4508#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {4775#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:46,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {4508#true} call #t~ret13 := main(); {4508#true} is VALID [2022-04-15 12:02:46,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4508#true} {4508#true} #67#return; {4508#true} is VALID [2022-04-15 12:02:46,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {4508#true} assume true; {4508#true} is VALID [2022-04-15 12:02:46,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4508#true} is VALID [2022-04-15 12:02:46,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {4508#true} call ULTIMATE.init(); {4508#true} is VALID [2022-04-15 12:02:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:02:46,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423130988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:46,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:46,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 21] total 57 [2022-04-15 12:02:46,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:46,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997013464] [2022-04-15 12:02:46,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997013464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:46,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:46,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:02:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132198045] [2022-04-15 12:02:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:46,997 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 12:02:46,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:46,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:47,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:47,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:02:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:47,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:02:47,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2693, Unknown=1, NotChecked=108, Total=3192 [2022-04-15 12:02:47,038 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:55,041 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-04-15 12:02:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 12:02:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 12:02:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 148 transitions. [2022-04-15 12:02:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 148 transitions. [2022-04-15 12:02:55,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 148 transitions. [2022-04-15 12:02:55,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:55,237 INFO L225 Difference]: With dead ends: 130 [2022-04-15 12:02:55,237 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 12:02:55,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3166 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1737, Invalid=9396, Unknown=1, NotChecked=208, Total=11342 [2022-04-15 12:02:55,240 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 290 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:55,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 74 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 12:02:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 12:02:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 59. [2022-04-15 12:02:55,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:55,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:02:55,513 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:02:55,513 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:02:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:55,526 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2022-04-15 12:02:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-04-15 12:02:55,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:55,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:55,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 128 states. [2022-04-15 12:02:55,529 INFO L87 Difference]: Start difference. First operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 128 states. [2022-04-15 12:02:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:55,534 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2022-04-15 12:02:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-04-15 12:02:55,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:55,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:55,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:55,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:02:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-15 12:02:55,536 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2022-04-15 12:02:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:55,536 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-15 12:02:55,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:02:55,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-15 12:02:55,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-15 12:02:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:02:55,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:55,663 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:55,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:55,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 12:02:55,863 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 3 times [2022-04-15 12:02:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:55,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [80734031] [2022-04-15 12:02:55,870 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:55,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 4 times [2022-04-15 12:02:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:55,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918914776] [2022-04-15 12:02:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:56,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5563#true} is VALID [2022-04-15 12:02:56,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:02:56,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5563#true} {5563#true} #67#return; {5563#true} is VALID [2022-04-15 12:02:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 12:02:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:56,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {5563#true} ~cond := #in~cond; {5563#true} is VALID [2022-04-15 12:02:56,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {5563#true} assume !(0 == ~cond); {5563#true} is VALID [2022-04-15 12:02:56,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:02:56,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5563#true} {5564#false} #65#return; {5564#false} is VALID [2022-04-15 12:02:56,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {5563#true} call ULTIMATE.init(); {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:56,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5563#true} is VALID [2022-04-15 12:02:56,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:02:56,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5563#true} {5563#true} #67#return; {5563#true} is VALID [2022-04-15 12:02:56,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {5563#true} call #t~ret13 := main(); {5563#true} is VALID [2022-04-15 12:02:56,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {5563#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 12:02:56,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {5568#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {5569#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:56,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {5569#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5569#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:02:56,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {5569#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5570#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:56,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {5570#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5570#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:56,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5571#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} is VALID [2022-04-15 12:02:56,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {5571#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5571#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} is VALID [2022-04-15 12:02:56,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {5571#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5572#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} is VALID [2022-04-15 12:02:56,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5572#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} is VALID [2022-04-15 12:02:56,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {5572#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5573#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:56,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {5573#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5573#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:56,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {5573#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5574#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967295) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:02:56,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {5574#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967295) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5564#false} is VALID [2022-04-15 12:02:56,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {5564#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {5564#false} assume !(~i~0 >= 0); {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {5564#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {5564#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L272 TraceCheckUtils]: 33: Hoare triple {5564#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5563#true} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {5563#true} ~cond := #in~cond; {5563#true} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {5563#true} assume !(0 == ~cond); {5563#true} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:02:56,211 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5563#true} {5564#false} #65#return; {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {5564#false} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {5564#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {5564#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L272 TraceCheckUtils]: 41: Hoare triple {5564#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5564#false} is VALID [2022-04-15 12:02:56,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {5564#false} ~cond := #in~cond; {5564#false} is VALID [2022-04-15 12:02:56,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {5564#false} assume 0 == ~cond; {5564#false} is VALID [2022-04-15 12:02:56,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {5564#false} assume !false; {5564#false} is VALID [2022-04-15 12:02:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 12:02:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918914776] [2022-04-15 12:02:56,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918914776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723426161] [2022-04-15 12:02:56,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:56,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:56,228 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:56,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:02:56,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:56,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:56,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 12:02:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:56,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:56,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:02:57,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 12:02:57,226 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 12:02:57,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-15 12:03:02,022 WARN L855 $PredicateComparison]: unable to prove that (exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296))) (let ((.cse0 (+ .cse1 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))) (and (<= .cse0 (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= .cse0 (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 .cse1 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4))) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4))) (<= .cse0 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 .cse1 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)))))) is different from true [2022-04-15 12:03:08,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:03:08,871 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 12:03:08,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 13 [2022-04-15 12:03:09,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {5563#true} call ULTIMATE.init(); {5563#true} is VALID [2022-04-15 12:03:09,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {5563#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5563#true} is VALID [2022-04-15 12:03:09,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:03:09,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5563#true} {5563#true} #67#return; {5563#true} is VALID [2022-04-15 12:03:09,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {5563#true} call #t~ret13 := main(); {5563#true} is VALID [2022-04-15 12:03:09,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {5563#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {5598#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {5635#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:03:09,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {5635#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5639#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:03:09,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {5639#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5643#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {5643#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5647#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {5647#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5651#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {5651#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5655#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 2))} is VALID [2022-04-15 12:03:09,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {5655#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 2))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5659#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (= (+ (- 1) main_~j~0) 2))} is VALID [2022-04-15 12:03:09,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {5659#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (= (+ (- 1) main_~j~0) 2))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5663#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 12:03:09,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {5663#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5667#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {5667#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5671#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {5671#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5675#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ 5 main_~i~0) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ 5 main_~i~0) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5679#(and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {5679#(and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5683#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 6)))} is VALID [2022-04-15 12:03:09,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {5683#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 6)))} assume !(~i~0 >= 0); {5687#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 6) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:09,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {5687#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 6) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 12:03:09,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 12:03:10,023 INFO L272 TraceCheckUtils]: 33: Hoare triple {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 12:03:10,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} ~cond := #in~cond; {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 12:03:10,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} assume !(0 == ~cond); {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 12:03:10,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} assume true; {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 12:03:10,147 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5698#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} #65#return; {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 12:03:10,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {5691#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {5714#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:03:10,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {5714#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5718#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:03:10,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {5718#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5722#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:03:10,235 INFO L272 TraceCheckUtils]: 41: Hoare triple {5722#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:03:10,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {5726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:03:10,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {5730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5564#false} is VALID [2022-04-15 12:03:10,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {5564#false} assume !false; {5564#false} is VALID [2022-04-15 12:03:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 2 not checked. [2022-04-15 12:03:10,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:11,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:03:11,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 12:03:12,026 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-04-15 12:03:12,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2022-04-15 12:03:12,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2022-04-15 12:03:12,087 INFO L356 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2022-04-15 12:03:12,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 502 treesize of output 434 [2022-04-15 12:03:12,292 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-04-15 12:03:12,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 201 [2022-04-15 12:03:12,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:03:12,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 12:03:12,922 INFO L356 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2022-04-15 12:03:12,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 256 treesize of output 234 [2022-04-15 12:03:13,146 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 12:03:13,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 1 [2022-04-15 12:03:14,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {5564#false} assume !false; {5564#false} is VALID [2022-04-15 12:03:14,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {5730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5564#false} is VALID [2022-04-15 12:03:14,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {5726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:03:14,426 INFO L272 TraceCheckUtils]: 41: Hoare triple {5722#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:03:14,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {5749#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5722#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:03:14,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {5753#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5749#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:03:14,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {5753#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:03:14,428 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5563#true} {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} #65#return; {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:03:14,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:03:14,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {5563#true} assume !(0 == ~cond); {5563#true} is VALID [2022-04-15 12:03:14,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {5563#true} ~cond := #in~cond; {5563#true} is VALID [2022-04-15 12:03:14,429 INFO L272 TraceCheckUtils]: 33: Hoare triple {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5563#true} is VALID [2022-04-15 12:03:14,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:03:14,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {5779#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {5757#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:03:14,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {5783#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} assume !(~i~0 >= 0); {5779#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} is VALID [2022-04-15 12:03:14,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {5787#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5783#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 12:03:14,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {5791#(or (not (<= 0 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5787#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 12:03:14,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {5795#(or (<= 2 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5791#(or (not (<= 0 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:03:14,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {5799#(or (<= 2 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5795#(or (<= 2 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_514 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_514)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:03:14,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {5803#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5799#(or (<= 2 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:03:14,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {5807#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5803#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:03:14,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {5811#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5807#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} is VALID [2022-04-15 12:03:14,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {5815#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5811#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 12:03:14,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5815#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 12:03:14,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {5823#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5819#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 12:03:14,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {5827#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 5 main_~i~0)) (<= 6 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5823#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} is VALID [2022-04-15 12:03:14,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {5831#(or (not (<= 5 main_~i~0)) (<= 6 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967301) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~j~0))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5827#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 5 main_~i~0)) (<= 6 main_~i~0))} is VALID [2022-04-15 12:03:14,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {5831#(or (not (<= 5 main_~i~0)) (<= 6 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967301) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~j~0))))))} is VALID [2022-04-15 12:03:14,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {5563#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {5835#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 12:03:14,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {5563#true} call #t~ret13 := main(); {5563#true} is VALID [2022-04-15 12:03:14,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5563#true} {5563#true} #67#return; {5563#true} is VALID [2022-04-15 12:03:14,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {5563#true} assume true; {5563#true} is VALID [2022-04-15 12:03:14,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {5563#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5563#true} is VALID [2022-04-15 12:03:14,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {5563#true} call ULTIMATE.init(); {5563#true} is VALID [2022-04-15 12:03:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:03:14,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723426161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:14,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:14,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24, 23] total 50 [2022-04-15 12:03:14,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:14,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [80734031] [2022-04-15 12:03:14,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [80734031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:14,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:14,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:03:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239291263] [2022-04-15 12:03:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:14,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-04-15 12:03:14,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:14,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:14,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:14,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:03:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:14,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:03:14,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2073, Unknown=1, NotChecked=94, Total=2450 [2022-04-15 12:03:14,478 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:15,532 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-04-15 12:03:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:03:15,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-04-15 12:03:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-15 12:03:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-15 12:03:15,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2022-04-15 12:03:15,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:15,604 INFO L225 Difference]: With dead ends: 83 [2022-04-15 12:03:15,604 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 12:03:15,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=384, Invalid=2699, Unknown=1, NotChecked=108, Total=3192 [2022-04-15 12:03:15,606 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:15,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 40 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:03:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 12:03:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-04-15 12:03:15,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:15,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:03:15,855 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:03:15,855 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:03:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:15,859 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-15 12:03:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 12:03:15,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:15,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:15,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 64 states. [2022-04-15 12:03:15,860 INFO L87 Difference]: Start difference. First operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 64 states. [2022-04-15 12:03:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:15,861 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-15 12:03:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 12:03:15,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:15,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:15,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:15,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:03:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-04-15 12:03:15,862 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2022-04-15 12:03:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:15,862 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-04-15 12:03:15,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:15,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 55 transitions. [2022-04-15 12:03:15,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-15 12:03:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:03:15,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:15,981 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:15,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:16,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:03:16,181 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 5 times [2022-04-15 12:03:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:16,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1078892171] [2022-04-15 12:03:16,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:16,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 6 times [2022-04-15 12:03:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:16,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490238895] [2022-04-15 12:03:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:17,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {6339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6305#true} is VALID [2022-04-15 12:03:17,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:17,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6305#true} {6305#true} #67#return; {6305#true} is VALID [2022-04-15 12:03:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-15 12:03:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:17,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#true} ~cond := #in~cond; {6305#true} is VALID [2022-04-15 12:03:17,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#true} assume !(0 == ~cond); {6305#true} is VALID [2022-04-15 12:03:17,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:17,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6305#true} {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 12:03:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:17,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#true} ~cond := #in~cond; {6305#true} is VALID [2022-04-15 12:03:17,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#true} assume !(0 == ~cond); {6305#true} is VALID [2022-04-15 12:03:17,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:17,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6305#true} {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:17,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {6305#true} call ULTIMATE.init(); {6339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:17,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {6339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6305#true} is VALID [2022-04-15 12:03:17,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:17,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6305#true} {6305#true} #67#return; {6305#true} is VALID [2022-04-15 12:03:17,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {6305#true} call #t~ret13 := main(); {6305#true} is VALID [2022-04-15 12:03:17,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {6305#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {6311#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:03:17,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {6311#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6312#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:03:17,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {6312#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6313#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:03:17,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {6313#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6314#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:03:17,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {6314#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6315#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 12:03:17,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {6315#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6316#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 12:03:17,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {6316#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6317#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} is VALID [2022-04-15 12:03:17,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {6317#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6318#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} is VALID [2022-04-15 12:03:17,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {6318#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6319#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)))} is VALID [2022-04-15 12:03:17,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {6319#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6320#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {6320#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6321#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:03:17,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {6321#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {6322#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {6322#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,580 INFO L272 TraceCheckUtils]: 31: Hoare triple {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6305#true} is VALID [2022-04-15 12:03:17,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {6305#true} ~cond := #in~cond; {6305#true} is VALID [2022-04-15 12:03:17,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {6305#true} assume !(0 == ~cond); {6305#true} is VALID [2022-04-15 12:03:17,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:17,581 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6305#true} {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:17,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {6323#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6328#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:17,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {6328#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:17,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:17,583 INFO L272 TraceCheckUtils]: 39: Hoare triple {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6305#true} is VALID [2022-04-15 12:03:17,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {6305#true} ~cond := #in~cond; {6305#true} is VALID [2022-04-15 12:03:17,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {6305#true} assume !(0 == ~cond); {6305#true} is VALID [2022-04-15 12:03:17,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:17,584 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6305#true} {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:17,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6334#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#str1~0.base|) 2) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:03:17,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {6334#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#str1~0.base|) 2) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6335#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (not (<= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 2))} is VALID [2022-04-15 12:03:17,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {6335#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (not (<= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6336#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:03:17,586 INFO L272 TraceCheckUtils]: 47: Hoare triple {6336#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6337#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:17,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {6337#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6338#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:17,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {6338#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6306#false} is VALID [2022-04-15 12:03:17,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {6306#false} assume !false; {6306#false} is VALID [2022-04-15 12:03:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 12:03:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:17,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490238895] [2022-04-15 12:03:17,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490238895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:17,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006214948] [2022-04-15 12:03:17,588 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:03:17,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:17,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:03:17,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:03:17,854 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:03:17,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:17,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 12:03:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:17,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:17,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:03:18,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 12:03:20,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:03:20,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-04-15 12:03:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:03:21,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-04-15 12:03:27,827 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)))) is different from true [2022-04-15 12:03:28,954 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2)))) is different from true [2022-04-15 12:03:29,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:03:29,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:03:29,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-04-15 12:03:29,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {6305#true} call ULTIMATE.init(); {6305#true} is VALID [2022-04-15 12:03:29,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6305#true} is VALID [2022-04-15 12:03:29,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:03:29,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6305#true} {6305#true} #67#return; {6305#true} is VALID [2022-04-15 12:03:29,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {6305#true} call #t~ret13 := main(); {6305#true} is VALID [2022-04-15 12:03:29,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {6305#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {6358#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {6358#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6358#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {6358#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6365#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:29,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {6365#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6365#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:29,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {6365#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6372#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {6372#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6372#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {6372#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6379#(and (= |main_~#str2~0.offset| 0) (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {6379#(and (= |main_~#str2~0.offset| 0) (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6379#(and (= |main_~#str2~0.offset| 0) (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {6379#(and (= |main_~#str2~0.offset| 0) (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {6310#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {6311#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:03:29,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {6311#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6312#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:03:29,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {6312#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6313#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:03:29,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {6313#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6314#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:03:29,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {6314#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6315#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 12:03:29,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {6315#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6413#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (exists ((v_main_~j~0_90 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= 2 v_main_~j~0_90) (<= v_main_~j~0_90 2) (<= (+ v_main_~j~0_90 1) main_~j~0))))} is VALID [2022-04-15 12:03:29,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {6413#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (exists ((v_main_~j~0_90 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= 2 v_main_~j~0_90) (<= v_main_~j~0_90 2) (<= (+ v_main_~j~0_90 1) main_~j~0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6417#(and (= |main_~#str2~0.offset| 0) (exists ((v_main_~j~0_90 Int)) (and (<= 2 v_main_~j~0_90) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= v_main_~j~0_90 2) (<= (+ v_main_~j~0_90 1) main_~j~0))) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))))} is VALID [2022-04-15 12:03:29,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {6417#(and (= |main_~#str2~0.offset| 0) (exists ((v_main_~j~0_90 Int)) (and (<= 2 v_main_~j~0_90) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= v_main_~j~0_90 2) (<= (+ v_main_~j~0_90 1) main_~j~0))) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6421#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (exists ((v_main_~j~0_90 Int)) (and (<= 2 v_main_~j~0_90) (<= (+ v_main_~j~0_90 2) main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= v_main_~j~0_90 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))} is VALID [2022-04-15 12:03:29,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {6421#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (exists ((v_main_~j~0_90 Int)) (and (<= 2 v_main_~j~0_90) (<= (+ v_main_~j~0_90 2) main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= v_main_~j~0_90 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6425#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)) (<= 0 (+ main_~i~0 1)) (exists ((v_main_~j~0_90 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= 2 v_main_~j~0_90) (<= (+ v_main_~j~0_90 2) main_~j~0) (<= v_main_~j~0_90 2))))} is VALID [2022-04-15 12:03:29,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {6425#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)) (<= 0 (+ main_~i~0 1)) (exists ((v_main_~j~0_90 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= 2 v_main_~j~0_90) (<= (+ v_main_~j~0_90 2) main_~j~0) (<= v_main_~j~0_90 2))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6429#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (exists ((v_main_~j~0_90 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= 2 v_main_~j~0_90) (<= v_main_~j~0_90 2))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))} is VALID [2022-04-15 12:03:29,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {6429#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (exists ((v_main_~j~0_90 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= 2 v_main_~j~0_90) (<= v_main_~j~0_90 2))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6433#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (exists ((v_main_~j~0_90 Int) (v_main_~i~0_157 Int)) (and (<= 0 v_main_~i~0_157) (<= 2 v_main_~j~0_90) (<= v_main_~i~0_157 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset| v_main_~i~0_157)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= v_main_~j~0_90 2) (<= (+ 4294967291 main_~max~0) (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {6433#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (exists ((v_main_~j~0_90 Int) (v_main_~i~0_157 Int)) (and (<= 0 v_main_~i~0_157) (<= 2 v_main_~j~0_90) (<= v_main_~i~0_157 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset| v_main_~i~0_157)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_90 |main_~#str2~0.offset|))) (<= v_main_~j~0_90 2) (<= (+ 4294967291 main_~max~0) (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {6322#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:03:29,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {6322#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:03:29,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:03:29,743 INFO L272 TraceCheckUtils]: 31: Hoare triple {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 12:03:29,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} ~cond := #in~cond; {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 12:03:29,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} assume !(0 == ~cond); {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 12:03:29,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} assume true; {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 12:03:29,745 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6447#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #65#return; {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:03:29,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {6440#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6328#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:29,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {6328#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:29,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:29,751 INFO L272 TraceCheckUtils]: 39: Hoare triple {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 12:03:29,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} ~cond := #in~cond; {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 12:03:29,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} assume !(0 == ~cond); {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 12:03:29,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} assume true; {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 12:03:29,753 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6472#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:03:29,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {6329#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6488#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:03:29,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {6488#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6492#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:03:29,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {6492#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6336#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:03:29,755 INFO L272 TraceCheckUtils]: 47: Hoare triple {6336#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:03:29,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {6499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:03:29,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {6503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6306#false} is VALID [2022-04-15 12:03:29,756 INFO L290 TraceCheckUtils]: 50: Hoare triple {6306#false} assume !false; {6306#false} is VALID [2022-04-15 12:03:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2022-04-15 12:03:29,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:34,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:03:34,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 974 treesize of output 910 [2022-04-15 12:05:03,581 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 12:05:03,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 984 treesize of output 932 [2022-04-15 12:05:04,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:05:04,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2022-04-15 12:05:04,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 445 treesize of output 427 [2022-04-15 12:05:04,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:05:04,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:05:04,968 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 12:05:04,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 225 treesize of output 1 [2022-04-15 12:05:04,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:05:04,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-04-15 12:05:05,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:05:05,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 212 [2022-04-15 12:05:05,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-04-15 12:05:05,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 984 treesize of output 948 [2022-04-15 12:05:06,083 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:05:06,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1924 treesize of output 1736 [2022-04-15 12:05:07,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:05:07,583 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 12:05:07,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 177 [2022-04-15 12:05:07,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:05:07,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 974 treesize of output 910 [2022-04-15 12:13:49,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:13:49,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-04-15 12:13:49,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 984 treesize of output 948 [2022-04-15 12:13:49,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:13:49,594 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 12:13:49,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2127 treesize of output 1891 [2022-04-15 12:13:53,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:13:53,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2022-04-15 12:13:53,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 472 treesize of output 454 [2022-04-15 12:13:55,489 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 12:13:55,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 844 treesize of output 792 [2022-04-15 12:13:58,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {6306#false} assume !false; {6306#false} is VALID [2022-04-15 12:13:58,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {6503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6306#false} is VALID [2022-04-15 12:13:58,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {6499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:13:58,068 INFO L272 TraceCheckUtils]: 47: Hoare triple {6336#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:13:58,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {6522#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6336#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:13:58,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {6526#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6522#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:13:58,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6526#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:13:58,070 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6305#true} {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} #65#return; {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:13:58,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:13:58,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {6305#true} assume !(0 == ~cond); {6305#true} is VALID [2022-04-15 12:13:58,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {6305#true} ~cond := #in~cond; {6305#true} is VALID [2022-04-15 12:13:58,070 INFO L272 TraceCheckUtils]: 39: Hoare triple {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6305#true} is VALID [2022-04-15 12:13:58,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:13:58,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {6552#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6530#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 12:13:58,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6552#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:13:58,082 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6305#true} {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} #65#return; {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:13:58,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:13:58,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {6305#true} assume !(0 == ~cond); {6305#true} is VALID [2022-04-15 12:13:58,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {6305#true} ~cond := #in~cond; {6305#true} is VALID [2022-04-15 12:13:58,082 INFO L272 TraceCheckUtils]: 31: Hoare triple {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6305#true} is VALID [2022-04-15 12:13:58,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:13:58,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {6578#(and (or (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298)))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {6556#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:13:58,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {6582#(or (and (or (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298)))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {6578#(and (or (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298)))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))} is VALID [2022-04-15 12:13:58,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {6586#(or (and (or (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298)))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6582#(or (and (or (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298)))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:13:58,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {6590#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)))))) (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6586#(or (and (or (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298)))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:13:58,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {6594#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)))))) (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6590#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)))))) (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:13:58,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {6598#(or (forall ((v_main_~j~0_98 Int)) (or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))))))) (< v_main_~j~0_98 (+ main_~j~0 1)))) (< main_~i~0 1) (<= 2 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6594#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)))))) (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 12:13:58,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {6602#(or (forall ((v_main_~j~0_98 Int)) (or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))))))) (< v_main_~j~0_98 (+ main_~j~0 1)))) (< main_~i~0 2) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6598#(or (forall ((v_main_~j~0_98 Int)) (or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))))))) (< v_main_~j~0_98 (+ main_~j~0 1)))) (< main_~i~0 1) (<= 2 main_~i~0))} is VALID [2022-04-15 12:13:58,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {6606#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967298)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298))) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ main_~i~0 2 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (< main_~i~0 2) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6602#(or (forall ((v_main_~j~0_98 Int)) (or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_576 Int) (v_ArrVal_573 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576)) |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset|)) (select (store (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_573) (+ v_main_~j~0_98 |main_~#str2~0.offset|) v_ArrVal_576) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967298))))))) (< v_main_~j~0_98 (+ main_~j~0 1)))) (< main_~i~0 2) (<= 3 main_~i~0))} is VALID [2022-04-15 12:13:58,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {6610#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= (+ main_~i~0 |main_~#str1~0.offset| 4294967297) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (< main_~i~0 3) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6606#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967298)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298))) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ main_~i~0 2 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (< main_~i~0 2) (<= 3 main_~i~0))} is VALID [2022-04-15 12:13:58,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {6614#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (+ main_~i~0 |main_~#str1~0.offset| 4294967297) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (< main_~i~0 3) (<= 4 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6610#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= (+ main_~i~0 |main_~#str1~0.offset| 4294967297) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)))))) (< main_~i~0 3) (<= 4 main_~i~0))} is VALID [2022-04-15 12:13:58,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {6618#(or (< main_~i~0 4) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296))) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6614#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (+ main_~i~0 |main_~#str1~0.offset| 4294967297) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (< main_~i~0 3) (<= 4 main_~i~0))} is VALID [2022-04-15 12:13:58,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {6622#(or (< main_~i~0 4) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))) (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (<= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296))) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6618#(or (< main_~i~0 4) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296))) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 12:13:58,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {6622#(or (< main_~i~0 4) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))) (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (<= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296))) (or (not (<= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (* (- 1) |main_~#str2~0.offset|) |main_~#str1~0.offset| 4294967300) (mod (+ main_~max~0 4294967295) 4294967296))) (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 12:13:58,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {6305#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {6626#(or (not (<= (+ |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:13:58,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {6305#true} call #t~ret13 := main(); {6305#true} is VALID [2022-04-15 12:13:58,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6305#true} {6305#true} #67#return; {6305#true} is VALID [2022-04-15 12:13:58,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {6305#true} assume true; {6305#true} is VALID [2022-04-15 12:13:58,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6305#true} is VALID [2022-04-15 12:13:58,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {6305#true} call ULTIMATE.init(); {6305#true} is VALID [2022-04-15 12:13:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 12:13:58,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006214948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:13:58,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:13:58,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29, 23] total 59 [2022-04-15 12:13:58,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:13:58,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1078892171] [2022-04-15 12:13:58,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1078892171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:13:58,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:13:58,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:13:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848398086] [2022-04-15 12:13:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:13:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-04-15 12:13:58,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:13:58,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:13:58,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:13:58,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:13:58,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:13:58,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:13:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2831, Unknown=4, NotChecked=222, Total=3422 [2022-04-15 12:13:58,197 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:14:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:01,949 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:14:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:14:01,949 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-04-15 12:14:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:14:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:14:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2022-04-15 12:14:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:14:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2022-04-15 12:14:01,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 53 transitions. [2022-04-15 12:14:02,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:14:02,055 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:14:02,055 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:14:02,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 60 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=741, Invalid=5269, Unknown=4, NotChecked=306, Total=6320 [2022-04-15 12:14:02,057 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:14:02,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 76 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:14:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:14:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-15 12:14:02,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:14:02,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:14:02,512 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:14:02,512 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:14:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:02,514 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-04-15 12:14:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-15 12:14:02,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:14:02,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:14:02,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 63 states. [2022-04-15 12:14:02,514 INFO L87 Difference]: Start difference. First operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 63 states. [2022-04-15 12:14:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:02,515 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-04-15 12:14:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-15 12:14:02,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:14:02,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:14:02,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:14:02,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:14:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:14:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-04-15 12:14:02,516 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2022-04-15 12:14:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:14:02,517 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-04-15 12:14:02,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:14:02,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 63 transitions. [2022-04-15 12:14:02,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:14:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-04-15 12:14:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:14:02,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:14:02,751 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:14:02,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 12:14:02,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:14:02,951 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:14:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:14:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 7 times [2022-04-15 12:14:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:14:02,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333573725] [2022-04-15 12:14:02,957 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:14:02,957 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:14:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 8 times [2022-04-15 12:14:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:14:02,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873711294] [2022-04-15 12:14:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:14:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:14:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:14:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:04,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {7143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7102#true} is VALID [2022-04-15 12:14:04,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7102#true} {7102#true} #67#return; {7102#true} is VALID [2022-04-15 12:14:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-15 12:14:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:04,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {7102#true} ~cond := #in~cond; {7102#true} is VALID [2022-04-15 12:14:04,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume !(0 == ~cond); {7102#true} is VALID [2022-04-15 12:14:04,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 12:14:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:04,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {7102#true} ~cond := #in~cond; {7102#true} is VALID [2022-04-15 12:14:04,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume !(0 == ~cond); {7102#true} is VALID [2022-04-15 12:14:04,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 12:14:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:04,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {7102#true} ~cond := #in~cond; {7102#true} is VALID [2022-04-15 12:14:04,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume !(0 == ~cond); {7102#true} is VALID [2022-04-15 12:14:04,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #65#return; {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:04,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {7102#true} call ULTIMATE.init(); {7143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:14:04,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {7143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7102#true} is VALID [2022-04-15 12:14:04,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7102#true} #67#return; {7102#true} is VALID [2022-04-15 12:14:04,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {7102#true} call #t~ret13 := main(); {7102#true} is VALID [2022-04-15 12:14:04,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {7102#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {7107#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {7107#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7107#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {7107#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {7109#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:14:04,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {7109#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7110#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:14:04,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {7110#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7111#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 3)) (and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {7111#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 3)) (and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7112#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 2 (+ main_~j~0 |main_~#str2~0.offset|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 3))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {7112#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 2 (+ main_~j~0 |main_~#str2~0.offset|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 3))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7113#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 |main_~#str1~0.offset|) 1) (<= 3 (+ main_~i~0 |main_~#str1~0.offset|)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= 2 (+ main_~j~0 |main_~#str2~0.offset|)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293)))))} is VALID [2022-04-15 12:14:04,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {7113#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 |main_~#str1~0.offset|) 1) (<= 3 (+ main_~i~0 |main_~#str1~0.offset|)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= 2 (+ main_~j~0 |main_~#str2~0.offset|)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7114#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 |main_~#str1~0.offset|) 1) (<= 3 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {7114#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 |main_~#str1~0.offset|) 1) (<= 3 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7115#(and (= |main_~#str2~0.offset| 0) (or (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0))) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {7115#(and (= |main_~#str2~0.offset| 0) (or (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0))) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7116#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 1)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0))) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {7116#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 1)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0))) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7117#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 1)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0))) (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {7117#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 1)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0))) (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7118#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {7118#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7119#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))))} is VALID [2022-04-15 12:14:04,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {7119#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))))} assume !(~i~0 >= 0); {7120#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {7120#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,614 INFO L272 TraceCheckUtils]: 31: Hoare triple {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7102#true} is VALID [2022-04-15 12:14:04,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {7102#true} ~cond := #in~cond; {7102#true} is VALID [2022-04-15 12:14:04,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {7102#true} assume !(0 == ~cond); {7102#true} is VALID [2022-04-15 12:14:04,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,615 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {7102#true} {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {7121#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {7126#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:04,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {7126#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:04,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:04,617 INFO L272 TraceCheckUtils]: 39: Hoare triple {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7102#true} is VALID [2022-04-15 12:14:04,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {7102#true} ~cond := #in~cond; {7102#true} is VALID [2022-04-15 12:14:04,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {7102#true} assume !(0 == ~cond); {7102#true} is VALID [2022-04-15 12:14:04,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,619 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7102#true} {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:04,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {7132#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:14:04,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {7132#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:04,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:04,621 INFO L272 TraceCheckUtils]: 47: Hoare triple {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7102#true} is VALID [2022-04-15 12:14:04,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {7102#true} ~cond := #in~cond; {7102#true} is VALID [2022-04-15 12:14:04,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {7102#true} assume !(0 == ~cond); {7102#true} is VALID [2022-04-15 12:14:04,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:04,622 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7102#true} {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #65#return; {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:04,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {7138#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))))} is VALID [2022-04-15 12:14:04,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {7138#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7139#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= (+ main_~i~0 |main_~#str1~0.offset|) 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:04,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {7139#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= (+ main_~i~0 |main_~#str1~0.offset|) 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7140#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:14:04,624 INFO L272 TraceCheckUtils]: 55: Hoare triple {7140#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:14:04,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {7141#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7142#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:14:04,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {7142#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7103#false} is VALID [2022-04-15 12:14:04,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-15 12:14:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 12:14:04,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:14:04,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873711294] [2022-04-15 12:14:04,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873711294] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:14:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719851379] [2022-04-15 12:14:04,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:14:04,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:14:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:14:04,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:14:04,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:14:04,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:14:04,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:14:04,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 12:14:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:04,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:14:04,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 12:14:05,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-04-15 12:14:05,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-04-15 12:14:05,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-04-15 12:14:05,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-04-15 12:14:09,349 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3)))) is different from true [2022-04-15 12:14:10,438 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1)))) is different from true [2022-04-15 12:14:11,450 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3)))) is different from true [2022-04-15 12:14:12,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:14:12,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:14:12,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-04-15 12:14:12,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {7102#true} call ULTIMATE.init(); {7102#true} is VALID [2022-04-15 12:14:12,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7102#true} is VALID [2022-04-15 12:14:12,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 12:14:12,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7102#true} #67#return; {7102#true} is VALID [2022-04-15 12:14:12,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {7102#true} call #t~ret13 := main(); {7102#true} is VALID [2022-04-15 12:14:12,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {7102#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~max~0 % 4294967296);havoc ~i~0;havoc ~j~0;~i~0 := 0; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {7108#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~max~0 - 1) % 4294967296, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {7109#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:14:12,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {7109#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7110#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 12:14:12,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {7110#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7204#(and (= |main_~#str2~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1))} is VALID [2022-04-15 12:14:12,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {7204#(and (= |main_~#str2~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7208#(and (= |main_~#str2~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0 |main_~#str2~0.offset|) 1))} is VALID [2022-04-15 12:14:12,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {7208#(and (= |main_~#str2~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (- 2) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294) 0))) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0 |main_~#str2~0.offset|) 1))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7212#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0 |main_~#str2~0.offset|) 1) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:14:12,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {7212#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0 |main_~#str2~0.offset|) 1) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7216#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ 3 (* (- 1) |main_~#str2~0.offset|))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} is VALID [2022-04-15 12:14:12,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {7216#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ 3 (* (- 1) |main_~#str2~0.offset|))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 3)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967293) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7220#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ 3 (* (- 1) |main_~#str2~0.offset|))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {7220#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ 3 (* (- 1) |main_~#str2~0.offset|))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7224#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ (* (- 1) |main_~#str2~0.offset|) 4)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {7224#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ (* (- 1) |main_~#str2~0.offset|) 4)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (or (and (= (+ 4294967292 (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 4)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7228#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ (* (- 1) |main_~#str2~0.offset|) 4)) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 5)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 3 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} is VALID [2022-04-15 12:14:12,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {7228#(and (= |main_~#str2~0.offset| 0) (= main_~j~0 (+ (* (- 1) |main_~#str2~0.offset|) 4)) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 (- 5)) 0) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 3 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7232#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 3 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} is VALID [2022-04-15 12:14:12,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {7232#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) 4294967291 main_~max~0) 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 3 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {7236#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 12:14:12,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {7236#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967294 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {7120#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:14:12,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {7120#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:14:12,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:14:12,228 INFO L272 TraceCheckUtils]: 31: Hoare triple {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} is VALID [2022-04-15 12:14:12,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} ~cond := #in~cond; {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} is VALID [2022-04-15 12:14:12,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} assume !(0 == ~cond); {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} is VALID [2022-04-15 12:14:12,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} assume true; {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} is VALID [2022-04-15 12:14:12,230 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {7250#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1))))} {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #65#return; {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 12:14:12,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {7243#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {7126#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:12,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {7126#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:12,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:12,234 INFO L272 TraceCheckUtils]: 39: Hoare triple {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} is VALID [2022-04-15 12:14:12,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} ~cond := #in~cond; {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} is VALID [2022-04-15 12:14:12,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} assume !(0 == ~cond); {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} is VALID [2022-04-15 12:14:12,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} assume true; {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} is VALID [2022-04-15 12:14:12,235 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7275#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_10| Int) (|v_main_~#str1~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_10| |v_main_~#str2~0.base_BEFORE_CALL_10|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_10|) 3) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_10|) 1))))} {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 12:14:12,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {7127#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {7132#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:14:12,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {7132#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:12,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:12,270 INFO L272 TraceCheckUtils]: 47: Hoare triple {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} is VALID [2022-04-15 12:14:12,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} ~cond := #in~cond; {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} is VALID [2022-04-15 12:14:12,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} assume !(0 == ~cond); {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} is VALID [2022-04-15 12:14:12,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} assume true; {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} is VALID [2022-04-15 12:14:12,275 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7300#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_11| Int) (|v_main_~#str2~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#str1~0.base_BEFORE_CALL_11| |v_main_~#str2~0.base_BEFORE_CALL_11|)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_11|) 1) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_11|) 3))))} {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #65#return; {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:14:12,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {7133#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {7316#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2) (<= main_~j~0 1))} is VALID [2022-04-15 12:14:12,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {7316#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2) (<= main_~j~0 1))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7320#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:14:12,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {7320#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) 3) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {7140#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 12:14:12,277 INFO L272 TraceCheckUtils]: 55: Hoare triple {7140#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:14:12,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {7327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:14:12,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {7331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7103#false} is VALID [2022-04-15 12:14:12,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-15 12:14:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 25 trivial. 18 not checked. [2022-04-15 12:14:12,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:14:13,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:14:13,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18338 treesize of output 17258 [2022-04-15 12:14:14,020 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 12:14:14,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:14:14,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:14:14,236 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:692) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:675) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:453) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:14:14,240 INFO L158 Benchmark]: Toolchain (without parser) took 748882.95ms. Allocated memory was 180.4MB in the beginning and 664.8MB in the end (delta: 484.4MB). Free memory was 125.2MB in the beginning and 388.2MB in the end (delta: -263.0MB). Peak memory consumption was 220.6MB. Max. memory is 8.0GB. [2022-04-15 12:14:14,240 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:14:14,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.68ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 151.0MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:14:14,241 INFO L158 Benchmark]: Boogie Preprocessor took 38.48ms. Allocated memory is still 180.4MB. Free memory was 151.0MB in the beginning and 149.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:14:14,241 INFO L158 Benchmark]: RCFGBuilder took 330.47ms. Allocated memory is still 180.4MB. Free memory was 149.3MB in the beginning and 136.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:14:14,241 INFO L158 Benchmark]: TraceAbstraction took 748227.48ms. Allocated memory was 180.4MB in the beginning and 664.8MB in the end (delta: 484.4MB). Free memory was 136.4MB in the beginning and 388.2MB in the end (delta: -251.9MB). Peak memory consumption was 233.2MB. Max. memory is 8.0GB. [2022-04-15 12:14:14,241 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.68ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 151.0MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.48ms. Allocated memory is still 180.4MB. Free memory was 151.0MB in the beginning and 149.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.47ms. Allocated memory is still 180.4MB. Free memory was 149.3MB in the beginning and 136.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 748227.48ms. Allocated memory was 180.4MB in the beginning and 664.8MB in the end (delta: 484.4MB). Free memory was 136.4MB in the beginning and 388.2MB in the end (delta: -251.9MB). Peak memory consumption was 233.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:14:14,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...