/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:43,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:43,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:43,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:43,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:43,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:43,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:43,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:43,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:43,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:43,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:43,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:43,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:43,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:43,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:43,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:43,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:43,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:44,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:44,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:44,012 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:44,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:44,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:44,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:44,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:44,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:44,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:44,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:44,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:44,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:44,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:44,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:44,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:44,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:44,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:44,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:44,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:44,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:44,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:44,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:44,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:44,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:44,048 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,058 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:44,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:44,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:44,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:44,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:44,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:44,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:44,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:44,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:44,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:44,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:44,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:44,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:44,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:44,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:44,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:44,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:44,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:44,077 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:44,077 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:44,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:44,077 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:44,077 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,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:44,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:44,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:44,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:44,511 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:44,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2022-04-15 12:01:44,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1200549/9f521dbfc5d344f99e3b770213e4dec8/FLAGce78354ce [2022-04-15 12:01:45,008 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:45,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2022-04-15 12:01:45,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1200549/9f521dbfc5d344f99e3b770213e4dec8/FLAGce78354ce [2022-04-15 12:01:45,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1200549/9f521dbfc5d344f99e3b770213e4dec8 [2022-04-15 12:01:45,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:45,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:45,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:45,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:45,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:45,047 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,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d8cedf 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,048 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,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:45,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:45,263 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-1.c[352,365] [2022-04-15 12:01:45,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:45,285 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:45,296 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-1.c[352,365] [2022-04-15 12:01:45,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:45,316 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:45,317 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,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:45,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:45,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:45,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:45,328 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,329 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,334 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,334 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,340 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,347 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,348 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,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:45,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:45,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:45,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:45,356 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,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:45,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:45,384 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,398 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,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:01:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:01:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 12:01:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:01:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:01:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:45,519 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:45,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:45,805 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:45,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:45,812 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:01:45,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:45 BoogieIcfgContainer [2022-04-15 12:01:45,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:45,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:45,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:45,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:45,823 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:45,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd2637d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:45, skipping insertion in model container [2022-04-15 12:01:45,824 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:45,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd2637d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:45, skipping insertion in model container [2022-04-15 12:01:45,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:45" (3/3) ... [2022-04-15 12:01:45,826 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2022-04-15 12:01:45,830 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:45,830 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:45,878 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:45,887 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:45,887 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:01:45,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:45,920 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:45,921 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1739069180, now seen corresponding path program 1 times [2022-04-15 12:01:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1981457130] [2022-04-15 12:01:45,943 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1739069180, now seen corresponding path program 2 times [2022-04-15 12:01:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:45,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409350413] [2022-04-15 12:01:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,155 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); {32#true} is VALID [2022-04-15 12:01:46,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 12:01:46,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2022-04-15 12:01:46,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:46,162 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); {32#true} is VALID [2022-04-15 12:01:46,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 12:01:46,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2022-04-15 12:01:46,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret14 := main(); {32#true} is VALID [2022-04-15 12:01:46,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {32#true} is VALID [2022-04-15 12:01:46,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(~MAX~0 > 0);assume false; {33#false} is VALID [2022-04-15 12:01:46,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {33#false} is VALID [2022-04-15 12:01:46,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-15 12:01:46,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {33#false} is VALID [2022-04-15 12:01:46,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-15 12:01:46,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {33#false} is VALID [2022-04-15 12:01:46,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {33#false} is VALID [2022-04-15 12:01:46,168 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {33#false} is VALID [2022-04-15 12:01:46,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 12:01:46,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 12:01:46,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 12:01:46,169 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,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:46,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409350413] [2022-04-15 12:01:46,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409350413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:46,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:46,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1981457130] [2022-04-15 12:01:46,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1981457130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104356422] [2022-04-15 12:01:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:46,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:46,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,213 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:46,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:46,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:46,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:46,234 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,304 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-15 12:01:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 12:01:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 12:01:46,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-15 12:01:46,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,402 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:01:46,402 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:01:46,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:46,407 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:46,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:01:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 12:01:46,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:46,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 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:46,436 INFO L74 IsIncluded]: Start isIncluded. First operand 24 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:46,437 INFO L87 Difference]: Start difference. First operand 24 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:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,439 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:46,440 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 24 states. [2022-04-15 12:01:46,441 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 24 states. [2022-04-15 12:01:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,443 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:46,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:46,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:46,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:46,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:46,444 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:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 12:01:46,447 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-15 12:01:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:46,447 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 12:01:46,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:46,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 12:01:46,475 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:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:01:46,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:46,477 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,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:46,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:46,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 186732794, now seen corresponding path program 1 times [2022-04-15 12:01:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921979004] [2022-04-15 12:01:46,479 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 186732794, now seen corresponding path program 2 times [2022-04-15 12:01:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:46,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909405966] [2022-04-15 12:01:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#(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); {238#true} is VALID [2022-04-15 12:01:46,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 12:01:46,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #74#return; {238#true} is VALID [2022-04-15 12:01:46,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:46,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#(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); {238#true} is VALID [2022-04-15 12:01:46,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 12:01:46,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #74#return; {238#true} is VALID [2022-04-15 12:01:46,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret14 := main(); {238#true} is VALID [2022-04-15 12:01:46,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {238#true} is VALID [2022-04-15 12:01:46,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#true} assume !!(~MAX~0 > 0); {243#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:46,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {244#(and (<= 1 main_~MAX~0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:46,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(and (<= 1 main_~MAX~0) (= main_~i~0 0))} assume !(~i~0 < ~MAX~0); {239#false} is VALID [2022-04-15 12:01:46,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {239#false} is VALID [2022-04-15 12:01:46,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {239#false} assume !(~i~0 >= 0); {239#false} is VALID [2022-04-15 12:01:46,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {239#false} is VALID [2022-04-15 12:01:46,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {239#false} is VALID [2022-04-15 12:01:46,624 INFO L272 TraceCheckUtils]: 13: Hoare triple {239#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {239#false} is VALID [2022-04-15 12:01:46,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2022-04-15 12:01:46,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#false} assume 0 == ~cond; {239#false} is VALID [2022-04-15 12:01:46,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-15 12:01:46,625 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,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:46,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909405966] [2022-04-15 12:01:46,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909405966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:46,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:46,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921979004] [2022-04-15 12:01:46,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921979004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333888597] [2022-04-15 12:01:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:46,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,654 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:46,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:46,656 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,839 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 12:01:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-15 12:01:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-15 12:01:46,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-15 12:01:46,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,906 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:01:46,906 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:01:46,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:01:46,909 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:46,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 24 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:01:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-15 12:01:46,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:46,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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,929 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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,931 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,933 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 12:01:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 12:01:46,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:46,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:46,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 30 states. [2022-04-15 12:01:46,935 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 30 states. [2022-04-15 12:01:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:46,937 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 12:01:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 12:01:46,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:46,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:46,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:46,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:01:46,939 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2022-04-15 12:01:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:46,939 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:01:46,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:46,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:01:46,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:01:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:01:46,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:46,973 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:46,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:46,973 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -848440424, now seen corresponding path program 1 times [2022-04-15 12:01:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2077087477] [2022-04-15 12:01:46,988 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:46,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash -848440424, now seen corresponding path program 2 times [2022-04-15 12:01:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:46,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321539611] [2022-04-15 12:01:46,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#(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); {450#true} is VALID [2022-04-15 12:01:47,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume true; {450#true} is VALID [2022-04-15 12:01:47,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {450#true} {450#true} #74#return; {450#true} is VALID [2022-04-15 12:01:47,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:47,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#(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); {450#true} is VALID [2022-04-15 12:01:47,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-04-15 12:01:47,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #74#return; {450#true} is VALID [2022-04-15 12:01:47,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret14 := main(); {450#true} is VALID [2022-04-15 12:01:47,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {450#true} is VALID [2022-04-15 12:01:47,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#true} assume !!(~MAX~0 > 0); {455#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:47,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {455#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:47,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#(<= 1 main_~MAX~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {455#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:47,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(<= 1 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {455#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:47,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#(<= 1 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {455#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:47,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#(<= 1 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {456#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:47,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {451#false} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {451#false} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {451#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {451#false} is VALID [2022-04-15 12:01:47,097 INFO L272 TraceCheckUtils]: 15: Hoare triple {451#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {451#false} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {451#false} ~cond := #in~cond; {451#false} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {451#false} assume 0 == ~cond; {451#false} is VALID [2022-04-15 12:01:47,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-04-15 12:01:47,098 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,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:47,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321539611] [2022-04-15 12:01:47,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321539611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:47,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:47,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:47,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:47,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2077087477] [2022-04-15 12:01:47,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2077087477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:47,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:47,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580891109] [2022-04-15 12:01:47,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:47,100 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:47,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:47,100 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:47,122 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:47,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:47,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:47,123 INFO L87 Difference]: Start difference. First operand 25 states and 27 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:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,285 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-15 12:01:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:47,285 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:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:47,286 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:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 12:01:47,287 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:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 12:01:47,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-15 12:01:47,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,326 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:01:47,326 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:01:47,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:01:47,327 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:47,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:01:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:01:47,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:47,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 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:47,354 INFO L74 IsIncluded]: Start isIncluded. First operand 26 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:47,355 INFO L87 Difference]: Start difference. First operand 26 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:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,359 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:01:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:47,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,361 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 26 states. [2022-04-15 12:01:47,361 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 26 states. [2022-04-15 12:01:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,363 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:01:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:47,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:47,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:47,365 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:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:01:47,372 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-04-15 12:01:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:47,372 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:01:47,372 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:47,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:01:47,410 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:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:01:47,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:47,415 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 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,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:01:47,416 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash 689124982, now seen corresponding path program 1 times [2022-04-15 12:01:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292570637] [2022-04-15 12:01:47,426 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:47,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 689124982, now seen corresponding path program 2 times [2022-04-15 12:01:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709087987] [2022-04-15 12:01:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {657#(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); {642#true} is VALID [2022-04-15 12:01:47,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#true} assume true; {642#true} is VALID [2022-04-15 12:01:47,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {642#true} {642#true} #74#return; {642#true} is VALID [2022-04-15 12:01:47,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {642#true} call ULTIMATE.init(); {657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:47,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#(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); {642#true} is VALID [2022-04-15 12:01:47,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {642#true} assume true; {642#true} is VALID [2022-04-15 12:01:47,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {642#true} {642#true} #74#return; {642#true} is VALID [2022-04-15 12:01:47,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {642#true} call #t~ret14 := main(); {642#true} is VALID [2022-04-15 12:01:47,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {642#true} is VALID [2022-04-15 12:01:47,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#true} assume !!(~MAX~0 > 0); {647#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:47,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {647#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {648#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~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:01:47,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {648#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {648#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~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:01:47,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {648#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {649#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:47,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 < ~MAX~0); {650#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:47,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {651#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:47,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {651#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {652#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:47,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {652#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:47,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} assume !(~i~0 >= 0); {652#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:47,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {653#(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_~j~0 |main_~#str2~0.offset|) 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:47,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {653#(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_~j~0 |main_~#str2~0.offset|) 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {654#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:47,892 INFO L272 TraceCheckUtils]: 17: Hoare triple {654#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:01:47,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {656#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:01:47,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {643#false} is VALID [2022-04-15 12:01:47,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#false} assume !false; {643#false} is VALID [2022-04-15 12:01:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:47,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709087987] [2022-04-15 12:01:47,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709087987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:47,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778406625] [2022-04-15 12:01:47,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:47,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:47,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:47,898 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,902 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,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:47,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:47,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:01:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:47,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:48,064 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:48,255 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 14 treesize of output 10 [2022-04-15 12:01:48,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:48,341 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 26 treesize of output 21 [2022-04-15 12:01:48,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:48,711 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 33 treesize of output 13 [2022-04-15 12:01:48,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {642#true} call ULTIMATE.init(); {642#true} is VALID [2022-04-15 12:01:48,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#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); {642#true} is VALID [2022-04-15 12:01:48,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {642#true} assume true; {642#true} is VALID [2022-04-15 12:01:48,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {642#true} {642#true} #74#return; {642#true} is VALID [2022-04-15 12:01:48,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {642#true} call #t~ret14 := main(); {642#true} is VALID [2022-04-15 12:01:48,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {642#true} is VALID [2022-04-15 12:01:48,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#true} assume !!(~MAX~0 > 0); {647#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:48,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {647#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {682#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {682#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {649#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:48,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 < ~MAX~0); {650#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:48,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {695#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|)) 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:48,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {695#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|)) 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {699#(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|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|))) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:48,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(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|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|))) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {699#(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|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|))) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:48,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {699#(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|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|))) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} assume !(~i~0 >= 0); {699#(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|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|))) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:01:48,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {699#(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|) (+ (- 1) main_~MAX~0 |main_~#str1~0.offset|))) (<= 1 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {709#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~j~0 |main_~#str1~0.offset|))))} is VALID [2022-04-15 12:01:48,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~j~0 |main_~#str1~0.offset|))))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {713#(and (= |main_#t~mem12| |main_#t~mem11|) (= |main_#t~mem12| 0))} is VALID [2022-04-15 12:01:48,845 INFO L272 TraceCheckUtils]: 17: Hoare triple {713#(and (= |main_#t~mem12| |main_#t~mem11|) (= |main_#t~mem12| 0))} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:48,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:48,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {643#false} is VALID [2022-04-15 12:01:48,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#false} assume !false; {643#false} is VALID [2022-04-15 12:01:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:48,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:48,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:48,985 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 212 treesize of output 166 [2022-04-15 12:01:49,014 INFO L356 Elim1Store]: treesize reduction 23, result has 46.5 percent of original size [2022-04-15 12:01:49,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 239 [2022-04-15 12:01:49,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:49,025 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 263 treesize of output 237 [2022-04-15 12:01:49,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:49,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:49,141 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 87 treesize of output 72 [2022-04-15 12:01:49,259 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 195 [2022-04-15 12:01:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 12:01:49,458 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-15 12:01:49,458 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 43 treesize of output 51 [2022-04-15 12:01:49,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#false} assume !false; {643#false} is VALID [2022-04-15 12:01:49,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {643#false} is VALID [2022-04-15 12:01:49,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:49,727 INFO L272 TraceCheckUtils]: 17: Hoare triple {654#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:49,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {740#(= (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 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {654#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:49,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {740#(= (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,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {744#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} assume !(~i~0 >= 0); {744#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:49,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {744#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {744#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:49,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(= (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_~#str1~0.offset|)) (+ (- 1) main_~MAX~0 |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_~#str1~0.offset|))) |main_~#str1~0.base|) |main_~#str1~0.offset|))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {744#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:49,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#(and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {754#(= (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_~#str1~0.offset|)) (+ (- 1) main_~MAX~0 |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_~#str1~0.offset|))) |main_~#str1~0.base|) |main_~#str1~0.offset|))} is VALID [2022-04-15 12:01:49,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {762#(or (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))) (< main_~i~0 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {758#(and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1)))} is VALID [2022-04-15 12:01:49,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {762#(or (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))) (< main_~i~0 main_~MAX~0))} is VALID [2022-04-15 12:01:49,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {766#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {766#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:49,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {647#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {766#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:49,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#true} assume !!(~MAX~0 > 0); {647#(<= 1 main_~MAX~0)} is VALID [2022-04-15 12:01:49,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {642#true} is VALID [2022-04-15 12:01:49,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {642#true} call #t~ret14 := main(); {642#true} is VALID [2022-04-15 12:01:49,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {642#true} {642#true} #74#return; {642#true} is VALID [2022-04-15 12:01:49,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {642#true} assume true; {642#true} is VALID [2022-04-15 12:01:49,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#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); {642#true} is VALID [2022-04-15 12:01:49,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {642#true} call ULTIMATE.init(); {642#true} is VALID [2022-04-15 12:01:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:49,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778406625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:49,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:49,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 26 [2022-04-15 12:01:49,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292570637] [2022-04-15 12:01:49,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292570637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:01:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198502554] [2022-04-15 12:01:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:49,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:49,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:49,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:49,767 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:49,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:01:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:01:49,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:01:49,770 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,743 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 12:01:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:01:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-15 12:01:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-15 12:01:50,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions. [2022-04-15 12:01:50,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,808 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:01:50,808 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:01:50,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:01:50,809 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:50,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:01:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:01:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-04-15 12:01:50,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:50,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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:01:50,851 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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:01:50,851 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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:01:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,853 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 12:01:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 12:01:50,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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 48 states. [2022-04-15 12:01:50,854 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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 48 states. [2022-04-15 12:01:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,856 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 12:01:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 12:01:50,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:50,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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:01:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-15 12:01:50,858 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2022-04-15 12:01:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:50,858 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-15 12:01:50,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:50,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-15 12:01:50,906 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:01:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 12:01:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:01:50,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:50,908 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:50,934 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:51,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:51,131 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 369179156, now seen corresponding path program 3 times [2022-04-15 12:01:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:51,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412613339] [2022-04-15 12:01:51,139 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:51,139 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 369179156, now seen corresponding path program 4 times [2022-04-15 12:01:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725027666] [2022-04-15 12:01:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(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); {1096#true} is VALID [2022-04-15 12:01:51,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#true} assume true; {1096#true} is VALID [2022-04-15 12:01:51,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1096#true} {1096#true} #74#return; {1096#true} is VALID [2022-04-15 12:01:51,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:51,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(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); {1096#true} is VALID [2022-04-15 12:01:51,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume true; {1096#true} is VALID [2022-04-15 12:01:51,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} #74#return; {1096#true} is VALID [2022-04-15 12:01:51,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} call #t~ret14 := main(); {1096#true} is VALID [2022-04-15 12:01:51,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {1096#true} is VALID [2022-04-15 12:01:51,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#true} assume !!(~MAX~0 > 0); {1096#true} is VALID [2022-04-15 12:01:51,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {1101#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {1101#(= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1101#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {1101#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1102#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:51,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {1102#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1103#(<= 2 main_~MAX~0)} is VALID [2022-04-15 12:01:51,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {1103#(<= 2 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1103#(<= 2 main_~MAX~0)} is VALID [2022-04-15 12:01:51,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {1103#(<= 2 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {1103#(<= 2 main_~MAX~0)} is VALID [2022-04-15 12:01:51,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {1103#(<= 2 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1102#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:51,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1102#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:51,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1104#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:51,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1097#false} is VALID [2022-04-15 12:01:51,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {1097#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1097#false} is VALID [2022-04-15 12:01:51,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {1097#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1097#false} is VALID [2022-04-15 12:01:51,214 INFO L272 TraceCheckUtils]: 19: Hoare triple {1097#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1097#false} is VALID [2022-04-15 12:01:51,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {1097#false} ~cond := #in~cond; {1097#false} is VALID [2022-04-15 12:01:51,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {1097#false} assume 0 == ~cond; {1097#false} is VALID [2022-04-15 12:01:51,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2022-04-15 12:01:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:51,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725027666] [2022-04-15 12:01:51,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725027666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:51,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738975776] [2022-04-15 12:01:51,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:51,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:51,216 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:51,244 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:51,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:51,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:51,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:01:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:51,319 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,468 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 15 treesize of output 15 [2022-04-15 12:01:52,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:01:52,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 26 treesize of output 10 [2022-04-15 12:01:52,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1096#true} is VALID [2022-04-15 12:01:52,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#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); {1096#true} is VALID [2022-04-15 12:01:52,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume true; {1096#true} is VALID [2022-04-15 12:01:52,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} #74#return; {1096#true} is VALID [2022-04-15 12:01:52,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} call #t~ret14 := main(); {1096#true} is VALID [2022-04-15 12:01:52,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {1096#true} is VALID [2022-04-15 12:01:52,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#true} assume !!(~MAX~0 > 0); {1127#(< 0 main_~MAX~0)} is VALID [2022-04-15 12:01:52,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {1127#(< 0 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2022-04-15 12:01:52,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2022-04-15 12:01:52,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2022-04-15 12:01:52,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2022-04-15 12:01:52,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2022-04-15 12:01:52,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2022-04-15 12:01:52,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1150#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (<= main_~MAX~0 (+ main_~i~0 1)))} is VALID [2022-04-15 12:01:52,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {1150#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (<= main_~MAX~0 (+ main_~i~0 1)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1154#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 (+ main_~i~0 1)))} is VALID [2022-04-15 12:01:52,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {1154#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 (+ main_~i~0 1)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1158#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 (+ main_~i~0 2)))} is VALID [2022-04-15 12:01:52,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {1158#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 (+ main_~i~0 2)))} assume !(~i~0 >= 0); {1162#(and (= |main_~#str2~0.offset| 0) (< main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:52,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {1162#(and (= |main_~#str2~0.offset| 0) (< main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1166#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (< 0 (+ main_~j~0 1)) (= main_~i~0 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_~#str1~0.offset|)) (< main_~j~0 1))} is VALID [2022-04-15 12:01:52,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (< 0 (+ main_~j~0 1)) (= main_~i~0 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_~#str1~0.offset|)) (< main_~j~0 1))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1170#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:52,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {1170#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:52,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:52,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1097#false} is VALID [2022-04-15 12:01:52,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2022-04-15 12:01:52,195 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,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:52,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:52,392 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 23 treesize of output 26 [2022-04-15 12:01:52,403 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 29 treesize of output 24 [2022-04-15 12:01:52,439 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-04-15 12:01:52,441 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 29 treesize of output 29 [2022-04-15 12:01:52,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2022-04-15 12:01:52,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1097#false} is VALID [2022-04-15 12:01:52,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:52,803 INFO L272 TraceCheckUtils]: 19: Hoare triple {1170#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:52,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {1197#(= (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 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1170#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:52,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1201#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1197#(= (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:52,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1205#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {1201#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:52,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1205#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:01:52,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {1213#(or (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 (+ main_~j~0 1))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 (+ main_~j~0 1)))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1209#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:52,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1213#(or (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 (+ main_~j~0 1))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 (+ main_~j~0 1)))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:52,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} assume !(~i~0 < ~MAX~0); {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:52,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:52,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:52,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:52,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:52,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1127#(< 0 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {1217#(or (<= 2 main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-15 12:01:52,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#true} assume !!(~MAX~0 > 0); {1127#(< 0 main_~MAX~0)} is VALID [2022-04-15 12:01:52,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {1096#true} is VALID [2022-04-15 12:01:52,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} call #t~ret14 := main(); {1096#true} is VALID [2022-04-15 12:01:52,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} #74#return; {1096#true} is VALID [2022-04-15 12:01:52,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume true; {1096#true} is VALID [2022-04-15 12:01:52,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#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); {1096#true} is VALID [2022-04-15 12:01:52,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1096#true} is VALID [2022-04-15 12:01:52,815 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,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738975776] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:52,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:52,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 23 [2022-04-15 12:01:52,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:52,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412613339] [2022-04-15 12:01:52,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412613339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:52,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:52,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:01:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538578508] [2022-04-15 12:01:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:52,817 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:52,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:52,818 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:52,834 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:52,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:01:52,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:01:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:01:52,836 INFO L87 Difference]: Start difference. First operand 39 states and 43 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:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,285 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-04-15 12:01:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:01:53,285 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:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:53,285 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:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-15 12:01:53,287 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:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-15 12:01:53,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-15 12:01:53,358 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:53,360 INFO L225 Difference]: With dead ends: 59 [2022-04-15 12:01:53,360 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:01:53,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:01:53,361 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:53,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 36 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:01:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-15 12:01:53,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:53,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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:01:53,439 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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:01:53,439 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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:01:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,440 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 12:01:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 12:01:53,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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 48 states. [2022-04-15 12:01:53,441 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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 48 states. [2022-04-15 12:01:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,443 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 12:01:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 12:01:53,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:53,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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:01:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-15 12:01:53,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2022-04-15 12:01:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:53,445 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-15 12:01:53,445 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:53,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-15 12:01:53,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 12:01:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:01:53,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:53,570 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:53,599 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:53,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:53,771 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:53,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1704530446, now seen corresponding path program 5 times [2022-04-15 12:01:53,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:53,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472211930] [2022-04-15 12:01:53,779 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:53,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1704530446, now seen corresponding path program 6 times [2022-04-15 12:01:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:53,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165414298] [2022-04-15 12:01:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:54,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:54,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {1586#(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); {1569#true} is VALID [2022-04-15 12:01:54,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1569#true} assume true; {1569#true} is VALID [2022-04-15 12:01:54,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1569#true} {1569#true} #74#return; {1569#true} is VALID [2022-04-15 12:01:54,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {1569#true} call ULTIMATE.init(); {1586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:54,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1586#(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); {1569#true} is VALID [2022-04-15 12:01:54,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {1569#true} assume true; {1569#true} is VALID [2022-04-15 12:01:54,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1569#true} {1569#true} #74#return; {1569#true} is VALID [2022-04-15 12:01:54,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1569#true} call #t~ret14 := main(); {1569#true} is VALID [2022-04-15 12:01:54,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1569#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {1569#true} is VALID [2022-04-15 12:01:54,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {1569#true} assume !!(~MAX~0 > 0); {1569#true} is VALID [2022-04-15 12:01:54,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1569#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {1574#(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:01:54,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#(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 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1574#(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:01:54,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(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~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1575#(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:01:54,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {1575#(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 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1576#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:54,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1577#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~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:01:54,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {1577#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !(~i~0 < ~MAX~0); {1578#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-15 12:01:54,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {1578#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1579#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-15 12:01:54,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1580#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} is VALID [2022-04-15 12:01:54,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1580#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} is VALID [2022-04-15 12:01:54,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1581#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:54,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {1581#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1581#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:54,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {1581#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} assume !(~i~0 >= 0); {1581#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-15 12:01:54,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {1581#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1582#(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|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1))} is VALID [2022-04-15 12:01:54,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {1582#(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|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1583#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:54,278 INFO L272 TraceCheckUtils]: 21: Hoare triple {1583#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:01:54,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {1584#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1585#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:01:54,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {1585#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1570#false} is VALID [2022-04-15 12:01:54,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {1570#false} assume !false; {1570#false} is VALID [2022-04-15 12:01:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:54,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165414298] [2022-04-15 12:01:54,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165414298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:54,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403504630] [2022-04-15 12:01:54,280 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:54,282 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:54,283 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:54,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:01:54,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:54,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 12:01:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:54,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:54,490 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:54,807 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:55,398 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-15 12:01:55,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-04-15 12:01:55,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {1569#true} call ULTIMATE.init(); {1569#true} is VALID [2022-04-15 12:01:55,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1569#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); {1569#true} is VALID [2022-04-15 12:01:55,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1569#true} assume true; {1569#true} is VALID [2022-04-15 12:01:55,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1569#true} {1569#true} #74#return; {1569#true} is VALID [2022-04-15 12:01:55,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {1569#true} call #t~ret14 := main(); {1569#true} is VALID [2022-04-15 12:01:55,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1569#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {1569#true} is VALID [2022-04-15 12:01:55,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {1569#true} assume !!(~MAX~0 > 0); {1569#true} is VALID [2022-04-15 12:01:55,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {1569#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {1611#(and (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {1611#(and (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1611#(and (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {1611#(and (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1618#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:55,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {1618#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1622#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1622#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1622#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 < ~MAX~0); {1622#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {1622#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1632#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 1)))} is VALID [2022-04-15 12:01:55,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {1632#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 1)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1636#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 1)))} is VALID [2022-04-15 12:01:55,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {1636#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 1)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1640#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 2)))} is VALID [2022-04-15 12:01:55,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {1640#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 2)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1644#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 2)))} is VALID [2022-04-15 12:01:55,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {1644#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 2)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1648#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= main_~MAX~0 (+ main_~i~0 3)) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {1648#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= main_~MAX~0 (+ main_~i~0 3)) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {1652#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< main_~MAX~0 3) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {1652#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< main_~MAX~0 3) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1656#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< main_~j~0 2) (< 0 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:01:55,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {1656#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< main_~j~0 2) (< 0 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1583#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:55,567 INFO L272 TraceCheckUtils]: 21: Hoare triple {1583#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:55,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {1663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:55,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {1667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1570#false} is VALID [2022-04-15 12:01:55,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {1570#false} assume !false; {1570#false} is VALID [2022-04-15 12:01:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:55,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:55,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:01:55,942 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 23 treesize of output 26 [2022-04-15 12:01:55,982 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 29 treesize of output 24 [2022-04-15 12:01:56,003 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-04-15 12:01:56,004 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 29 treesize of output 29 [2022-04-15 12:01:56,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {1570#false} assume !false; {1570#false} is VALID [2022-04-15 12:01:56,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {1667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1570#false} is VALID [2022-04-15 12:01:56,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:56,333 INFO L272 TraceCheckUtils]: 21: Hoare triple {1583#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:56,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#(= (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 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1583#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:01:56,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {1690#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1686#(= (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:56,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {1694#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {1690#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:01:56,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {1698#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1694#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 0 main_~i~0))} is VALID [2022-04-15 12:01:56,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {1702#(or (<= 1 main_~i~0) (= main_~MAX~0 (+ main_~j~0 1)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1698#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:56,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {1706#(or (<= 2 main_~i~0) (= main_~MAX~0 (+ main_~j~0 1)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {1702#(or (<= 1 main_~i~0) (= main_~MAX~0 (+ main_~j~0 1)))} is VALID [2022-04-15 12:01:56,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {1710#(or (<= 2 main_~i~0) (= main_~MAX~0 (+ main_~j~0 2)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {1706#(or (<= 2 main_~i~0) (= main_~MAX~0 (+ main_~j~0 1)))} is VALID [2022-04-15 12:01:56,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {1714#(or (= main_~MAX~0 2) (<= 3 main_~MAX~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1710#(or (<= 2 main_~i~0) (= main_~MAX~0 (+ main_~j~0 2)))} is VALID [2022-04-15 12:01:56,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {1714#(or (= main_~MAX~0 2) (<= 3 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {1714#(or (= main_~MAX~0 2) (<= 3 main_~MAX~0))} is VALID [2022-04-15 12:01:56,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1714#(or (= main_~MAX~0 2) (<= 3 main_~MAX~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1714#(or (= main_~MAX~0 2) (<= 3 main_~MAX~0))} is VALID [2022-04-15 12:01:56,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {1724#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1714#(or (= main_~MAX~0 2) (<= 3 main_~MAX~0))} is VALID [2022-04-15 12:01:56,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#(<= 0 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1724#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:56,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#(<= 0 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {1728#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:56,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {1569#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {1728#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:56,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1569#true} assume !!(~MAX~0 > 0); {1569#true} is VALID [2022-04-15 12:01:56,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {1569#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {1569#true} is VALID [2022-04-15 12:01:56,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {1569#true} call #t~ret14 := main(); {1569#true} is VALID [2022-04-15 12:01:56,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1569#true} {1569#true} #74#return; {1569#true} is VALID [2022-04-15 12:01:56,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {1569#true} assume true; {1569#true} is VALID [2022-04-15 12:01:56,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1569#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); {1569#true} is VALID [2022-04-15 12:01:56,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {1569#true} call ULTIMATE.init(); {1569#true} is VALID [2022-04-15 12:01:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:56,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403504630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:56,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:56,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-04-15 12:01:56,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:56,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472211930] [2022-04-15 12:01:56,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472211930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:56,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:56,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:01:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569060150] [2022-04-15 12:01:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:56,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:56,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:56,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:56,384 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:56,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:01:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:01:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1156, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:01:56,386 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:58,571 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-04-15 12:01:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:01:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 64 transitions. [2022-04-15 12:01:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 64 transitions. [2022-04-15 12:01:58,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 64 transitions. [2022-04-15 12:01:58,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:58,844 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:01:58,844 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:01:58,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=510, Invalid=2570, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:01:58,846 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:58,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 70 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:01:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:01:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-04-15 12:01:59,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:59,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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:01:59,044 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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:01:59,044 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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:01:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:59,047 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-15 12:01:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-15 12:01:59,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:59,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:59,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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:01:59,048 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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:01:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:59,050 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-15 12:01:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-15 12:01:59,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:59,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:59,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:59,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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:01:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-15 12:01:59,052 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 25 [2022-04-15 12:01:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:59,052 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-15 12:01:59,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 13 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:01:59,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-15 12:01:59,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 12:01:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:01:59,167 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:59,167 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:59,221 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:59,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:59,372 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1823608176, now seen corresponding path program 7 times [2022-04-15 12:01:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1224260865] [2022-04-15 12:01:59,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:59,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1823608176, now seen corresponding path program 8 times [2022-04-15 12:01:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:59,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000930812] [2022-04-15 12:01:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:59,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {2174#(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); {2164#true} is VALID [2022-04-15 12:01:59,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#true} assume true; {2164#true} is VALID [2022-04-15 12:01:59,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2164#true} {2164#true} #74#return; {2164#true} is VALID [2022-04-15 12:01:59,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {2164#true} call ULTIMATE.init(); {2174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:59,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {2174#(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); {2164#true} is VALID [2022-04-15 12:01:59,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {2164#true} assume true; {2164#true} is VALID [2022-04-15 12:01:59,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2164#true} {2164#true} #74#return; {2164#true} is VALID [2022-04-15 12:01:59,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {2164#true} call #t~ret14 := main(); {2164#true} is VALID [2022-04-15 12:01:59,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {2164#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {2164#true} is VALID [2022-04-15 12:01:59,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {2164#true} assume !!(~MAX~0 > 0); {2164#true} is VALID [2022-04-15 12:01:59,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {2164#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {2169#(= main_~i~0 0)} is VALID [2022-04-15 12:01:59,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {2169#(= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2169#(= main_~i~0 0)} is VALID [2022-04-15 12:01:59,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {2169#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#(<= 1 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {2171#(<= 2 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#(<= 3 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#(<= 3 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {2172#(<= 3 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {2171#(<= 2 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(<= 2 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {2170#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {2170#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {2173#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {2165#false} is VALID [2022-04-15 12:01:59,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {2165#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {2165#false} is VALID [2022-04-15 12:01:59,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {2165#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2165#false} is VALID [2022-04-15 12:01:59,574 INFO L272 TraceCheckUtils]: 23: Hoare triple {2165#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2165#false} is VALID [2022-04-15 12:01:59,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {2165#false} ~cond := #in~cond; {2165#false} is VALID [2022-04-15 12:01:59,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {2165#false} assume 0 == ~cond; {2165#false} is VALID [2022-04-15 12:01:59,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {2165#false} assume !false; {2165#false} is VALID [2022-04-15 12:01:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:59,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000930812] [2022-04-15 12:01:59,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000930812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:59,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738494343] [2022-04-15 12:01:59,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:59,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:59,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:59,585 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,611 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,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:59,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:59,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:01:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:59,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:59,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {2164#true} call ULTIMATE.init(); {2164#true} is VALID [2022-04-15 12:01:59,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#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); {2164#true} is VALID [2022-04-15 12:01:59,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {2164#true} assume true; {2164#true} is VALID [2022-04-15 12:01:59,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2164#true} {2164#true} #74#return; {2164#true} is VALID [2022-04-15 12:01:59,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {2164#true} call #t~ret14 := main(); {2164#true} is VALID [2022-04-15 12:01:59,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2164#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {2164#true} is VALID [2022-04-15 12:01:59,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {2164#true} assume !!(~MAX~0 > 0); {2164#true} is VALID [2022-04-15 12:01:59,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {2164#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#(<= 0 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {2173#(<= 0 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#(<= 1 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {2171#(<= 2 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#(<= 3 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#(<= 3 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {2172#(<= 3 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {2171#(<= 2 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(<= 2 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {2170#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {2170#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {2173#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {2165#false} is VALID [2022-04-15 12:01:59,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {2165#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {2165#false} is VALID [2022-04-15 12:01:59,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {2165#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2165#false} is VALID [2022-04-15 12:01:59,803 INFO L272 TraceCheckUtils]: 23: Hoare triple {2165#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2165#false} is VALID [2022-04-15 12:01:59,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2165#false} ~cond := #in~cond; {2165#false} is VALID [2022-04-15 12:01:59,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {2165#false} assume 0 == ~cond; {2165#false} is VALID [2022-04-15 12:01:59,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {2165#false} assume !false; {2165#false} is VALID [2022-04-15 12:01:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:59,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:59,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {2165#false} assume !false; {2165#false} is VALID [2022-04-15 12:01:59,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {2165#false} assume 0 == ~cond; {2165#false} is VALID [2022-04-15 12:01:59,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {2165#false} ~cond := #in~cond; {2165#false} is VALID [2022-04-15 12:01:59,935 INFO L272 TraceCheckUtils]: 23: Hoare triple {2165#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2165#false} is VALID [2022-04-15 12:01:59,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {2165#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2165#false} is VALID [2022-04-15 12:01:59,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {2165#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {2165#false} is VALID [2022-04-15 12:01:59,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {2173#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {2165#false} is VALID [2022-04-15 12:01:59,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {2170#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {2170#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(<= 2 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {2171#(<= 2 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {2172#(<= 3 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#(<= 3 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#(<= 3 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {2171#(<= 2 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2172#(<= 3 main_~MAX~0)} is VALID [2022-04-15 12:01:59,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#(<= 1 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2171#(<= 2 main_~i~0)} is VALID [2022-04-15 12:01:59,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {2173#(<= 0 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2170#(<= 1 main_~i~0)} is VALID [2022-04-15 12:01:59,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#(<= 0 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2164#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {2173#(<= 0 main_~i~0)} is VALID [2022-04-15 12:01:59,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {2164#true} assume !!(~MAX~0 > 0); {2164#true} is VALID [2022-04-15 12:01:59,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {2164#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {2164#true} is VALID [2022-04-15 12:01:59,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {2164#true} call #t~ret14 := main(); {2164#true} is VALID [2022-04-15 12:01:59,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2164#true} {2164#true} #74#return; {2164#true} is VALID [2022-04-15 12:01:59,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {2164#true} assume true; {2164#true} is VALID [2022-04-15 12:01:59,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#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); {2164#true} is VALID [2022-04-15 12:01:59,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {2164#true} call ULTIMATE.init(); {2164#true} is VALID [2022-04-15 12:01:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:59,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738494343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:59,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:59,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-04-15 12:01:59,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:59,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1224260865] [2022-04-15 12:01:59,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1224260865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:59,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:59,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:01:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787459671] [2022-04-15 12:01:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:59,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:01:59,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:59,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:59,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:59,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:01:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:01:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:01:59,973 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:00,713 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-15 12:02:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:02:00,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2022-04-15 12:02:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2022-04-15 12:02:00,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2022-04-15 12:02:00,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:00,792 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:02:00,792 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:02:00,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:02:00,793 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:00,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 41 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:02:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:02:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-04-15 12:02:00,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:00,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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:00,931 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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:00,931 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:00,936 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-04-15 12:02:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-04-15 12:02:00,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:00,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:00,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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 63 states. [2022-04-15 12:02:00,937 INFO L87 Difference]: Start difference. First operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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 63 states. [2022-04-15 12:02:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:00,939 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-04-15 12:02:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-04-15 12:02:00,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:00,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:00,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:00,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-04-15 12:02:00,956 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2022-04-15 12:02:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:00,958 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-04-15 12:02:00,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:00,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 53 transitions. [2022-04-15 12:02:01,033 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:02:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 12:02:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:02:01,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:01,034 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:01,091 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,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:01,235 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 463472720, now seen corresponding path program 1 times [2022-04-15 12:02:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651301232] [2022-04-15 12:02:01,241 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:01,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 463472720, now seen corresponding path program 2 times [2022-04-15 12:02:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:01,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647601442] [2022-04-15 12:02:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:01,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {2738#(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); {2724#true} is VALID [2022-04-15 12:02:01,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #74#return; {2724#true} is VALID [2022-04-15 12:02:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 12:02:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:01,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {2724#true} ~cond := #in~cond; {2724#true} is VALID [2022-04-15 12:02:01,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume !(0 == ~cond); {2724#true} is VALID [2022-04-15 12:02:01,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} #72#return; {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:01,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2738#(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); {2724#true} is VALID [2022-04-15 12:02:01,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #74#return; {2724#true} is VALID [2022-04-15 12:02:01,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret14 := main(); {2724#true} is VALID [2022-04-15 12:02:01,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {2724#true} is VALID [2022-04-15 12:02:01,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#true} assume !!(~MAX~0 > 0); {2724#true} is VALID [2022-04-15 12:02:01,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {2729#(= main_~i~0 0)} is VALID [2022-04-15 12:02:01,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {2729#(= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2729#(= main_~i~0 0)} is VALID [2022-04-15 12:02:01,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {2729#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2730#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:01,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~i~0 1)} assume !(~i~0 < ~MAX~0); {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {2731#(<= main_~MAX~0 1)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {2731#(<= main_~MAX~0 1)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {2731#(<= main_~MAX~0 1)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {2731#(<= main_~MAX~0 1)} assume !(~i~0 >= 0); {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {2731#(<= main_~MAX~0 1)} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,398 INFO L272 TraceCheckUtils]: 17: Hoare triple {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2724#true} is VALID [2022-04-15 12:02:01,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} ~cond := #in~cond; {2724#true} is VALID [2022-04-15 12:02:01,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == ~cond); {2724#true} is VALID [2022-04-15 12:02:01,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,399 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2724#true} {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} #72#return; {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} havoc #t~mem11;havoc #t~mem12;#t~post13 := ~j~0;~j~0 := #t~post13 - 1;havoc #t~post13; {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {2732#(and (= main_~i~0 0) (<= main_~MAX~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2737#(<= main_~MAX~0 main_~i~0)} is VALID [2022-04-15 12:02:01,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(<= main_~MAX~0 main_~i~0)} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2725#false} is VALID [2022-04-15 12:02:01,400 INFO L272 TraceCheckUtils]: 25: Hoare triple {2725#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2725#false} is VALID [2022-04-15 12:02:01,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {2725#false} ~cond := #in~cond; {2725#false} is VALID [2022-04-15 12:02:01,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {2725#false} assume 0 == ~cond; {2725#false} is VALID [2022-04-15 12:02:01,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 12:02:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:02:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:01,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647601442] [2022-04-15 12:02:01,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647601442] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:01,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968369301] [2022-04-15 12:02:01,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:01,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:01,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:01,414 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:01,452 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:01,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:01,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:01,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:02:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:01,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:01,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2022-04-15 12:02:01,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#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); {2724#true} is VALID [2022-04-15 12:02:01,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #74#return; {2724#true} is VALID [2022-04-15 12:02:01,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret14 := main(); {2724#true} is VALID [2022-04-15 12:02:01,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {2724#true} is VALID [2022-04-15 12:02:01,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#true} assume !!(~MAX~0 > 0); {2724#true} is VALID [2022-04-15 12:02:01,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {2763#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:01,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#(<= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2763#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:01,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {2763#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2730#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:01,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~i~0 1)} assume !(~i~0 < ~MAX~0); {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {2731#(<= main_~MAX~0 1)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {2731#(<= main_~MAX~0 1)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {2731#(<= main_~MAX~0 1)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {2731#(<= main_~MAX~0 1)} assume !(~i~0 >= 0); {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {2731#(<= main_~MAX~0 1)} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,752 INFO L272 TraceCheckUtils]: 17: Hoare triple {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2724#true} is VALID [2022-04-15 12:02:01,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} ~cond := #in~cond; {2724#true} is VALID [2022-04-15 12:02:01,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == ~cond); {2724#true} is VALID [2022-04-15 12:02:01,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,753 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2724#true} {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} #72#return; {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} havoc #t~mem11;havoc #t~mem12;#t~post13 := ~j~0;~j~0 := #t~post13 - 1;havoc #t~post13; {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-15 12:02:01,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {2788#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2813#(and (<= main_~MAX~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:01,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {2813#(and (<= main_~MAX~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2725#false} is VALID [2022-04-15 12:02:01,754 INFO L272 TraceCheckUtils]: 25: Hoare triple {2725#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2725#false} is VALID [2022-04-15 12:02:01,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {2725#false} ~cond := #in~cond; {2725#false} is VALID [2022-04-15 12:02:01,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {2725#false} assume 0 == ~cond; {2725#false} is VALID [2022-04-15 12:02:01,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 12:02:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:02:01,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:01,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 12:02:01,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {2725#false} assume 0 == ~cond; {2725#false} is VALID [2022-04-15 12:02:01,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {2725#false} ~cond := #in~cond; {2725#false} is VALID [2022-04-15 12:02:01,944 INFO L272 TraceCheckUtils]: 25: Hoare triple {2725#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2725#false} is VALID [2022-04-15 12:02:01,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(<= main_~MAX~0 main_~i~0)} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2725#false} is VALID [2022-04-15 12:02:01,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {2844#(<= main_~MAX~0 (+ main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2737#(<= main_~MAX~0 main_~i~0)} is VALID [2022-04-15 12:02:01,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {2844#(<= main_~MAX~0 (+ main_~i~0 1))} havoc #t~mem11;havoc #t~mem12;#t~post13 := ~j~0;~j~0 := #t~post13 - 1;havoc #t~post13; {2844#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-15 12:02:01,946 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2724#true} {2844#(<= main_~MAX~0 (+ main_~i~0 1))} #72#return; {2844#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-15 12:02:01,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == ~cond); {2724#true} is VALID [2022-04-15 12:02:01,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} ~cond := #in~cond; {2724#true} is VALID [2022-04-15 12:02:01,947 INFO L272 TraceCheckUtils]: 17: Hoare triple {2844#(<= main_~MAX~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2724#true} is VALID [2022-04-15 12:02:01,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {2844#(<= main_~MAX~0 (+ main_~i~0 1))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2844#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-15 12:02:01,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {2731#(<= main_~MAX~0 1)} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {2844#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-15 12:02:01,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {2731#(<= main_~MAX~0 1)} assume !(~i~0 >= 0); {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {2731#(<= main_~MAX~0 1)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {2731#(<= main_~MAX~0 1)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {2731#(<= main_~MAX~0 1)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~i~0 1)} assume !(~i~0 < ~MAX~0); {2731#(<= main_~MAX~0 1)} is VALID [2022-04-15 12:02:01,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {2763#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2730#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:01,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#(<= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {2763#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:01,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {2763#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:01,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#true} assume !!(~MAX~0 > 0); {2724#true} is VALID [2022-04-15 12:02:01,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {2724#true} is VALID [2022-04-15 12:02:01,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret14 := main(); {2724#true} is VALID [2022-04-15 12:02:01,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #74#return; {2724#true} is VALID [2022-04-15 12:02:01,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:02:01,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#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); {2724#true} is VALID [2022-04-15 12:02:01,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2022-04-15 12:02:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:02:01,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968369301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:01,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:01,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-15 12:02:01,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:01,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651301232] [2022-04-15 12:02:01,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651301232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:01,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:01,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:02:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492523262] [2022-04-15 12:02:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:01,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 29 [2022-04-15 12:02:01,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:01,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:01,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:01,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:02:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:02:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:02:01,983 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:02,642 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 12:02:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:02:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 29 [2022-04-15 12:02:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-15 12:02:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-15 12:02:02,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-15 12:02:02,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:02,732 INFO L225 Difference]: With dead ends: 75 [2022-04-15 12:02:02,732 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:02:02,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:02:02,739 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:02,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 32 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:02:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:02:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-04-15 12:02:02,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:02,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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:02,880 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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:02,882 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:02,898 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-15 12:02:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-15 12:02:02,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:02,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:02,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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 55 states. [2022-04-15 12:02:02,899 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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 55 states. [2022-04-15 12:02:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:02,901 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-15 12:02:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-15 12:02:02,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:02,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:02,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:02,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-15 12:02:02,902 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2022-04-15 12:02:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:02,903 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-15 12:02:02,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:02,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-15 12:02:02,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 12:02:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:02:02,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:02,991 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:03,015 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:03,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:03,206 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash -144214162, now seen corresponding path program 9 times [2022-04-15 12:02:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:03,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594188225] [2022-04-15 12:02:03,211 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:03,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -144214162, now seen corresponding path program 10 times [2022-04-15 12:02:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:03,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218742310] [2022-04-15 12:02:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:03,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:03,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {3301#(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); {3282#true} is VALID [2022-04-15 12:02:03,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {3282#true} assume true; {3282#true} is VALID [2022-04-15 12:02:03,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3282#true} {3282#true} #74#return; {3282#true} is VALID [2022-04-15 12:02:03,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {3282#true} call ULTIMATE.init(); {3301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:03,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {3301#(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); {3282#true} is VALID [2022-04-15 12:02:03,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {3282#true} assume true; {3282#true} is VALID [2022-04-15 12:02:03,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3282#true} {3282#true} #74#return; {3282#true} is VALID [2022-04-15 12:02:03,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {3282#true} call #t~ret14 := main(); {3282#true} is VALID [2022-04-15 12:02:03,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {3282#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {3282#true} is VALID [2022-04-15 12:02:03,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {3282#true} assume !!(~MAX~0 > 0); {3282#true} is VALID [2022-04-15 12:02:03,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {3282#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {3287#(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:03,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {3287#(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 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3287#(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:03,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {3287#(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~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3288#(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:03,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {3288#(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 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3288#(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:03,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {3288#(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~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3289#(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:03,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {3289#(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 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3290#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:03,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {3290#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3291#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:03,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {3291#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 3))} assume !(~i~0 < ~MAX~0); {3292#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {3293#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {3293#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3294#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1))} is VALID [2022-04-15 12:02:03,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {3294#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3294#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1))} is VALID [2022-04-15 12:02:03,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {3294#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3295#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 3 main_~MAX~0) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 3 main_~MAX~0) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3295#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 3 main_~MAX~0) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#(and (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 3 main_~MAX~0) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3296#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {3296#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3296#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {3296#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {3296#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:03,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {3296#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {3297#(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_~j~0 2) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (<= (+ main_~j~0 |main_~#str2~0.offset|) 1)))} is VALID [2022-04-15 12:02:03,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {3297#(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_~j~0 2) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (<= (+ main_~j~0 |main_~#str2~0.offset|) 1)))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3298#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:02:03,865 INFO L272 TraceCheckUtils]: 25: Hoare triple {3298#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3299#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:02:03,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {3299#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3300#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:02:03,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {3300#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3283#false} is VALID [2022-04-15 12:02:03,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {3283#false} assume !false; {3283#false} is VALID [2022-04-15 12:02:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:03,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218742310] [2022-04-15 12:02:03,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218742310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:03,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95323741] [2022-04-15 12:02:03,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:03,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:03,868 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:03,869 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:03,948 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:03,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:03,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:02:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:03,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:03,992 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:04,494 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:04,876 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-15 12:02:04,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-04-15 12:02:04,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {3282#true} call ULTIMATE.init(); {3282#true} is VALID [2022-04-15 12:02:04,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {3282#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); {3282#true} is VALID [2022-04-15 12:02:04,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {3282#true} assume true; {3282#true} is VALID [2022-04-15 12:02:04,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3282#true} {3282#true} #74#return; {3282#true} is VALID [2022-04-15 12:02:04,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {3282#true} call #t~ret14 := main(); {3282#true} is VALID [2022-04-15 12:02:04,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {3282#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {3282#true} is VALID [2022-04-15 12:02:04,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {3282#true} assume !!(~MAX~0 > 0); {3282#true} is VALID [2022-04-15 12:02:04,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {3282#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {3326#(and (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(and (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3326#(and (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {3326#(and (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3333#(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:04,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#(and (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3333#(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:04,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#(and (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3340#(and (= |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:04,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {3340#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3340#(and (= |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:04,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {3340#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3347#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:04,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {3347#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 3))} assume !(~i~0 < ~MAX~0); {3351#(and (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {3351#(and (<= main_~MAX~0 3) (= |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), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {3355#(and (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {3355#(and (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3359#(and (= (+ (- 1) main_~j~0) 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#(and (= (+ (- 1) main_~j~0) 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3363#(and (<= (+ main_~i~0 2) main_~MAX~0) (= (+ (- 1) main_~j~0) 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {3363#(and (<= (+ main_~i~0 2) main_~MAX~0) (= (+ (- 1) main_~j~0) 0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3367#(and (<= (+ main_~i~0 2) main_~MAX~0) (<= main_~MAX~0 3) (= |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:04,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {3367#(and (<= (+ main_~i~0 2) main_~MAX~0) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3371#(and (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (<= (+ main_~i~0 3) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {3371#(and (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (<= (+ main_~i~0 3) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3375#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3375#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {3375#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {3375#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {3375#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (<= main_~MAX~0 3) (= |main_~#str1~0.offset| 0) (<= 3 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {3385#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 12:02:04,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {3385#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3298#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:02:04,987 INFO L272 TraceCheckUtils]: 25: Hoare triple {3298#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:04,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {3392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:04,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {3396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3283#false} is VALID [2022-04-15 12:02:04,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {3283#false} assume !false; {3283#false} is VALID [2022-04-15 12:02:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:04,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:05,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:02:05,124 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 23 treesize of output 26 [2022-04-15 12:02:05,145 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-04-15 12:02:05,145 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 29 treesize of output 29 [2022-04-15 12:02:05,166 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 29 treesize of output 24 [2022-04-15 12:02:05,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {3283#false} assume !false; {3283#false} is VALID [2022-04-15 12:02:05,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {3396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3283#false} is VALID [2022-04-15 12:02:05,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {3392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:05,593 INFO L272 TraceCheckUtils]: 25: Hoare triple {3298#(= |main_#t~mem12| |main_#t~mem11|)} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:05,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {3415#(= (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 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3298#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-15 12:02:05,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {3419#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {3415#(= (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:05,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {3419#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} assume !(~i~0 >= 0); {3419#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:02:05,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3419#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:02:05,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {3429#(or (not (<= 0 main_~i~0)) (= main_~MAX~0 (+ main_~j~0 1)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3419#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 12:02:05,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {3433#(or (< main_~i~0 1) (= main_~MAX~0 (+ main_~j~0 1)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3429#(or (not (<= 0 main_~i~0)) (= main_~MAX~0 (+ main_~j~0 1)))} is VALID [2022-04-15 12:02:05,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {3437#(or (< main_~i~0 1) (= main_~MAX~0 (+ main_~j~0 2)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3433#(or (< main_~i~0 1) (= main_~MAX~0 (+ main_~j~0 1)))} is VALID [2022-04-15 12:02:05,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {3441#(or (< main_~i~0 2) (= main_~MAX~0 (+ main_~j~0 2)))} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3437#(or (< main_~i~0 1) (= main_~MAX~0 (+ main_~j~0 2)))} is VALID [2022-04-15 12:02:05,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {3445#(or (< main_~i~0 2) (= main_~MAX~0 (+ main_~j~0 3)))} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3441#(or (< main_~i~0 2) (= main_~MAX~0 (+ main_~j~0 2)))} is VALID [2022-04-15 12:02:05,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {3449#(or (< main_~MAX~0 3) (= main_~MAX~0 3))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {3445#(or (< main_~i~0 2) (= main_~MAX~0 (+ main_~j~0 3)))} is VALID [2022-04-15 12:02:05,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {3453#(<= main_~i~0 3)} assume !(~i~0 < ~MAX~0); {3449#(or (< main_~MAX~0 3) (= main_~MAX~0 3))} is VALID [2022-04-15 12:02:05,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {3457#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3453#(<= main_~i~0 3)} is VALID [2022-04-15 12:02:05,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#(<= main_~i~0 2)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3457#(<= main_~i~0 2)} is VALID [2022-04-15 12:02:05,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {3464#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3457#(<= main_~i~0 2)} is VALID [2022-04-15 12:02:05,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {3464#(<= main_~i~0 1)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3464#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:05,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {3471#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3464#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:05,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3471#(<= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3471#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:05,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {3282#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {3471#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:05,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {3282#true} assume !!(~MAX~0 > 0); {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {3282#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {3282#true} call #t~ret14 := main(); {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3282#true} {3282#true} #74#return; {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {3282#true} assume true; {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {3282#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); {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {3282#true} call ULTIMATE.init(); {3282#true} is VALID [2022-04-15 12:02:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95323741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:05,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:05,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 43 [2022-04-15 12:02:05,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594188225] [2022-04-15 12:02:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594188225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:05,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:05,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:02:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157471121] [2022-04-15 12:02:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:05,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:05,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:05,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:05,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:02:05,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:05,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:02:05,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:02:05,633 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:08,405 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-04-15 12:02:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:02:08,405 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-15 12:02:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-15 12:02:08,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-15 12:02:08,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:08,493 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:02:08,493 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 12:02:08,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=732, Invalid=3690, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:02:08,494 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:08,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 72 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:02:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 12:02:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2022-04-15 12:02:08,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:08,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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:08,643 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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:08,643 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:08,646 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-04-15 12:02:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-04-15 12:02:08,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:08,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:08,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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 80 states. [2022-04-15 12:02:08,647 INFO L87 Difference]: Start difference. First operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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 80 states. [2022-04-15 12:02:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:08,657 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-04-15 12:02:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-04-15 12:02:08,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:08,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:08,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:08,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-04-15 12:02:08,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 29 [2022-04-15 12:02:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:08,660 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-04-15 12:02:08,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 57 transitions. [2022-04-15 12:02:08,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 12:02:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:02:08,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:08,745 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:08,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:08,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:08,946 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112588, now seen corresponding path program 11 times [2022-04-15 12:02:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715978228] [2022-04-15 12:02:08,966 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:08,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112588, now seen corresponding path program 12 times [2022-04-15 12:02:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220935811] [2022-04-15 12:02:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:09,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {3988#(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); {3977#true} is VALID [2022-04-15 12:02:09,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {3977#true} assume true; {3977#true} is VALID [2022-04-15 12:02:09,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3977#true} {3977#true} #74#return; {3977#true} is VALID [2022-04-15 12:02:09,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {3977#true} call ULTIMATE.init(); {3988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:09,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {3988#(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); {3977#true} is VALID [2022-04-15 12:02:09,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {3977#true} assume true; {3977#true} is VALID [2022-04-15 12:02:09,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3977#true} {3977#true} #74#return; {3977#true} is VALID [2022-04-15 12:02:09,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {3977#true} call #t~ret14 := main(); {3977#true} is VALID [2022-04-15 12:02:09,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {3977#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {3977#true} is VALID [2022-04-15 12:02:09,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {3977#true} assume !!(~MAX~0 > 0); {3977#true} is VALID [2022-04-15 12:02:09,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {3977#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {3982#(= main_~i~0 0)} is VALID [2022-04-15 12:02:09,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {3982#(= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3982#(= main_~i~0 0)} is VALID [2022-04-15 12:02:09,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {3982#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {3983#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {3983#(<= 1 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {3984#(<= 2 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {3984#(<= 2 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {3985#(<= 3 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {3986#(<= 4 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {3986#(<= 4 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {3986#(<= 4 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {3985#(<= 3 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {3985#(<= 3 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {3984#(<= 2 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {3984#(<= 2 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {3983#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {3983#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {3987#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {3978#false} is VALID [2022-04-15 12:02:09,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {3978#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {3978#false} is VALID [2022-04-15 12:02:09,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {3978#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3978#false} is VALID [2022-04-15 12:02:09,115 INFO L272 TraceCheckUtils]: 27: Hoare triple {3978#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3978#false} is VALID [2022-04-15 12:02:09,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {3978#false} ~cond := #in~cond; {3978#false} is VALID [2022-04-15 12:02:09,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {3978#false} assume 0 == ~cond; {3978#false} is VALID [2022-04-15 12:02:09,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {3978#false} assume !false; {3978#false} is VALID [2022-04-15 12:02:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220935811] [2022-04-15 12:02:09,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220935811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452308134] [2022-04-15 12:02:09,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:09,117 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:09,119 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:09,213 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:02:09,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:09,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:02:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:09,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:09,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {3977#true} call ULTIMATE.init(); {3977#true} is VALID [2022-04-15 12:02:09,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {3977#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); {3977#true} is VALID [2022-04-15 12:02:09,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {3977#true} assume true; {3977#true} is VALID [2022-04-15 12:02:09,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3977#true} {3977#true} #74#return; {3977#true} is VALID [2022-04-15 12:02:09,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {3977#true} call #t~ret14 := main(); {3977#true} is VALID [2022-04-15 12:02:09,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {3977#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {3977#true} is VALID [2022-04-15 12:02:09,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {3977#true} assume !!(~MAX~0 > 0); {3977#true} is VALID [2022-04-15 12:02:09,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {3977#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {3987#(<= 0 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {3987#(<= 0 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {3983#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {3983#(<= 1 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {3984#(<= 2 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {3984#(<= 2 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {3985#(<= 3 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {3986#(<= 4 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {3986#(<= 4 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {3986#(<= 4 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {3985#(<= 3 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {3985#(<= 3 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {3984#(<= 2 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {3984#(<= 2 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {3983#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {3983#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {3987#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {3978#false} is VALID [2022-04-15 12:02:09,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {3978#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {3978#false} is VALID [2022-04-15 12:02:09,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {3978#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3978#false} is VALID [2022-04-15 12:02:09,424 INFO L272 TraceCheckUtils]: 27: Hoare triple {3978#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3978#false} is VALID [2022-04-15 12:02:09,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {3978#false} ~cond := #in~cond; {3978#false} is VALID [2022-04-15 12:02:09,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {3978#false} assume 0 == ~cond; {3978#false} is VALID [2022-04-15 12:02:09,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {3978#false} assume !false; {3978#false} is VALID [2022-04-15 12:02:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:09,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:09,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {3978#false} assume !false; {3978#false} is VALID [2022-04-15 12:02:09,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {3978#false} assume 0 == ~cond; {3978#false} is VALID [2022-04-15 12:02:09,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {3978#false} ~cond := #in~cond; {3978#false} is VALID [2022-04-15 12:02:09,634 INFO L272 TraceCheckUtils]: 27: Hoare triple {3978#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3978#false} is VALID [2022-04-15 12:02:09,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {3978#false} assume !!(~i~0 < ~MAX~0);call #t~mem11 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem12 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3978#false} is VALID [2022-04-15 12:02:09,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {3978#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {3978#false} is VALID [2022-04-15 12:02:09,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {3987#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {3978#false} is VALID [2022-04-15 12:02:09,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {3983#(<= 1 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {3983#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {3984#(<= 2 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {3984#(<= 2 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {3985#(<= 3 main_~i~0)} #t~post7 := ~i~0;~i~0 := #t~post7 - 1;havoc #t~post7; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {3985#(<= 3 main_~i~0)} assume !!(~i~0 >= 0);call #t~mem8 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem8, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem8;#t~post9 := ~j~0;~j~0 := 1 + #t~post9;havoc #t~post9; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {3986#(<= 4 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {3986#(<= 4 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {3986#(<= 4 main_~MAX~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {3985#(<= 3 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3986#(<= 4 main_~MAX~0)} is VALID [2022-04-15 12:02:09,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {3984#(<= 2 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3985#(<= 3 main_~i~0)} is VALID [2022-04-15 12:02:09,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {3984#(<= 2 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {3983#(<= 1 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3984#(<= 2 main_~i~0)} is VALID [2022-04-15 12:02:09,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {3983#(<= 1 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {3987#(<= 0 main_~i~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3983#(<= 1 main_~i~0)} is VALID [2022-04-15 12:02:09,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {3987#(<= 0 main_~i~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet6; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {3977#true} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {3987#(<= 0 main_~i~0)} is VALID [2022-04-15 12:02:09,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {3977#true} assume !!(~MAX~0 > 0); {3977#true} is VALID [2022-04-15 12:02:09,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {3977#true} ~MAX~0 := (if #t~nondet4 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet4 % 4294967296 % 4294967296 else #t~nondet4 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet4; {3977#true} is VALID [2022-04-15 12:02:09,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {3977#true} call #t~ret14 := main(); {3977#true} is VALID [2022-04-15 12:02:09,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3977#true} {3977#true} #74#return; {3977#true} is VALID [2022-04-15 12:02:09,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {3977#true} assume true; {3977#true} is VALID [2022-04-15 12:02:09,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {3977#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); {3977#true} is VALID [2022-04-15 12:02:09,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {3977#true} call ULTIMATE.init(); {3977#true} is VALID [2022-04-15 12:02:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:09,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452308134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:09,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:09,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2022-04-15 12:02:09,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:09,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715978228] [2022-04-15 12:02:09,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715978228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:09,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:09,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:02:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934775524] [2022-04-15 12:02:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:09,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:09,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:09,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:09,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:02:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:02:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:02:09,681 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:10,843 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-04-15 12:02:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:02:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2022-04-15 12:02:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2022-04-15 12:02:10,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 91 transitions. [2022-04-15 12:02:10,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:10,929 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:02:10,929 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:02:10,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:02:10,930 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:10,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:02:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:02:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2022-04-15 12:02:11,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:11,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 54 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 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:11,110 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 54 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 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:11,117 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 54 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 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:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,119 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-04-15 12:02:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-04-15 12:02:11,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:11,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:11,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 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 77 states. [2022-04-15 12:02:11,121 INFO L87 Difference]: Start difference. First operand has 54 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 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 77 states. [2022-04-15 12:02:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,133 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-04-15 12:02:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-04-15 12:02:11,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:11,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:11,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:11,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 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:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-04-15 12:02:11,137 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 31 [2022-04-15 12:02:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:11,138 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-04-15 12:02:11,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:11,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 59 transitions. [2022-04-15 12:02:11,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-15 12:02:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:02:11,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:11,348 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:11,386 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:11,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:11,549 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1181909964, now seen corresponding path program 3 times [2022-04-15 12:02:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:11,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925941702] [2022-04-15 12:02:11,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:11,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1181909964, now seen corresponding path program 4 times [2022-04-15 12:02:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:11,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772532781] [2022-04-15 12:02:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:02:11,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:02:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:02:11,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:02:11,665 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 12:02:11,665 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 12:02:11,667 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:02:11,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:02:11,671 INFO L719 BasicCegarLoop]: Path program histogram: [12, 4, 2, 2, 2] [2022-04-15 12:02:11,673 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:02:11,688 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 12:02:11,689 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 12:02:11,690 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 12:02:11,691 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:02:11,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:02:11 BoogieIcfgContainer [2022-04-15 12:02:11,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:02:11,693 INFO L158 Benchmark]: Toolchain (without parser) took 26653.57ms. Allocated memory was 154.1MB in the beginning and 268.4MB in the end (delta: 114.3MB). Free memory was 102.7MB in the beginning and 122.0MB in the end (delta: -19.3MB). Peak memory consumption was 95.9MB. Max. memory is 8.0GB. [2022-04-15 12:02:11,693 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 154.1MB. Free memory was 119.0MB in the beginning and 118.9MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:02:11,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.80ms. Allocated memory is still 154.1MB. Free memory was 102.5MB in the beginning and 129.7MB in the end (delta: -27.1MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-15 12:02:11,695 INFO L158 Benchmark]: Boogie Preprocessor took 34.22ms. Allocated memory is still 154.1MB. Free memory was 129.7MB in the beginning and 127.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:02:11,699 INFO L158 Benchmark]: RCFGBuilder took 459.83ms. Allocated memory is still 154.1MB. Free memory was 127.9MB in the beginning and 115.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:02:11,700 INFO L158 Benchmark]: TraceAbstraction took 25877.27ms. Allocated memory was 154.1MB in the beginning and 268.4MB in the end (delta: 114.3MB). Free memory was 114.6MB in the beginning and 122.0MB in the end (delta: -7.4MB). Peak memory consumption was 107.8MB. Max. memory is 8.0GB. [2022-04-15 12:02:11,700 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.15ms. Allocated memory is still 154.1MB. Free memory was 119.0MB in the beginning and 118.9MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.80ms. Allocated memory is still 154.1MB. Free memory was 102.5MB in the beginning and 129.7MB in the end (delta: -27.1MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.22ms. Allocated memory is still 154.1MB. Free memory was 129.7MB in the beginning and 127.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 459.83ms. Allocated memory is still 154.1MB. Free memory was 127.9MB in the beginning and 115.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 25877.27ms. Allocated memory was 154.1MB in the beginning and 268.4MB in the end (delta: 114.3MB). Free memory was 114.6MB in the beginning and 122.0MB in the end (delta: -7.4MB). Peak memory consumption was 107.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int MAX = __VERIFIER_nondet_uint(); [L17] COND FALSE !(!(MAX > 0)) [L18] char str1[MAX], str2[MAX]; [L19] int cont, i, j; [L20] cont = 0 [L22] i=0 [L22] COND TRUE i= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ [L29] i-- [L29] COND TRUE i >= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ [L29] i-- [L29] COND FALSE !(i >= 0) [L34] j = MAX-1 [L35] i=0 [L35] COND TRUE i