/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 05:38:18,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 05:38:18,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 05:38:18,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 05:38:18,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 05:38:18,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 05:38:18,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 05:38:18,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 05:38:18,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 05:38:18,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 05:38:18,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 05:38:18,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 05:38:18,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 05:38:18,456 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 05:38:18,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 05:38:18,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 05:38:18,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 05:38:18,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 05:38:18,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 05:38:18,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 05:38:18,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 05:38:18,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 05:38:18,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 05:38:18,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 05:38:18,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 05:38:18,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 05:38:18,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 05:38:18,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 05:38:18,459 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 05:38:18,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 05:38:18,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:38:18,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 05:38:18,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 05:38:18,462 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 05:38:18,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 05:38:18,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 05:38:18,462 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 05:38:18,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 05:38:18,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 05:38:18,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 05:38:18,463 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 05:38:18,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-03 05:38:18,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 05:38:18,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 05:38:18,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 05:38:18,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 05:38:18,767 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 05:38:18,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-05-03 05:38:19,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 05:38:20,093 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 05:38:20,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-05-03 05:38:20,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6f506d4f3/a331a5329da04d668029e244ccfb9e59/FLAG43db75ff3 [2024-05-03 05:38:20,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6f506d4f3/a331a5329da04d668029e244ccfb9e59 [2024-05-03 05:38:20,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 05:38:20,115 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 05:38:20,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 05:38:20,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 05:38:20,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 05:38:20,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be42df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20, skipping insertion in model container [2024-05-03 05:38:20,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 05:38:20,309 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2474,2487] [2024-05-03 05:38:20,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:38:20,329 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 05:38:20,347 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2474,2487] [2024-05-03 05:38:20,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:38:20,364 INFO L206 MainTranslator]: Completed translation [2024-05-03 05:38:20,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20 WrapperNode [2024-05-03 05:38:20,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 05:38:20,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 05:38:20,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 05:38:20,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 05:38:20,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,403 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 144 [2024-05-03 05:38:20,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 05:38:20,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 05:38:20,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 05:38:20,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 05:38:20,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 05:38:20,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 05:38:20,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 05:38:20,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 05:38:20,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (1/1) ... [2024-05-03 05:38:20,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:38:20,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:38:20,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 05:38:20,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 05:38:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 05:38:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 05:38:20,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 05:38:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 05:38:20,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 05:38:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 05:38:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 05:38:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 05:38:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 05:38:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 05:38:20,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 05:38:20,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 05:38:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 05:38:20,526 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 05:38:20,638 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 05:38:20,639 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 05:38:20,877 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 05:38:20,897 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 05:38:20,897 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 05:38:20,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:38:20 BoogieIcfgContainer [2024-05-03 05:38:20,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 05:38:20,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 05:38:20,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 05:38:20,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 05:38:20,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 05:38:20" (1/3) ... [2024-05-03 05:38:20,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6719a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:38:20, skipping insertion in model container [2024-05-03 05:38:20,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:38:20" (2/3) ... [2024-05-03 05:38:20,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6719a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:38:20, skipping insertion in model container [2024-05-03 05:38:20,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:38:20" (3/3) ... [2024-05-03 05:38:20,936 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2024-05-03 05:38:20,946 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 05:38:20,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 05:38:20,976 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 05:38:20,976 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 05:38:21,065 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 05:38:21,105 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:38:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:38:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:38:21,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:38:21,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 05:38:21,144 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:38:21,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 05:38:21,159 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e753cf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:38:21,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:38:21,173 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:21,394 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,394 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,394 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,492 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,493 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,493 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,577 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,577 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,577 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,612 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,612 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,613 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,657 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,657 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,658 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,693 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,694 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,694 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,716 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,716 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,716 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,742 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,742 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,743 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,770 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,771 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,771 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,814 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,815 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,815 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,852 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,853 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,853 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,879 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,879 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,879 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,989 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:21,990 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:21,990 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:21,995 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 744 states. [2024-05-03 05:38:21,995 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:38:21,999 INFO L78 Accepts]: Start accepts. Automaton has currently 788 states, but on-demand construction may add more states Word has length 107 [2024-05-03 05:38:22,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:22,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:22,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 198291129, now seen corresponding path program 1 times [2024-05-03 05:38:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90500663] [2024-05-03 05:38:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:38:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90500663] [2024-05-03 05:38:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90500663] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:38:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:38:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 05:38:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471145136] [2024-05-03 05:38:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:38:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 05:38:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 05:38:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 05:38:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:22,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:22,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:22,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:22,298 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:22,349 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,350 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,350 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,407 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,407 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,408 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,427 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,428 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,428 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,446 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,446 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,446 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,461 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,461 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,461 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,480 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,481 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,481 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,505 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,505 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,505 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,522 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,522 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,522 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,535 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,536 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,536 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,560 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,561 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,561 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,579 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,579 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,579 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,592 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,592 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,593 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,671 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:22,671 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:22,672 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:22,681 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 807 states. [2024-05-03 05:38:22,681 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:38:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:22,682 INFO L78 Accepts]: Start accepts. Automaton has currently 891 states, but on-demand construction may add more states Word has length 102 [2024-05-03 05:38:22,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 05:38:22,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:22,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 732039595, now seen corresponding path program 1 times [2024-05-03 05:38:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391522948] [2024-05-03 05:38:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:38:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391522948] [2024-05-03 05:38:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391522948] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:38:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:38:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-03 05:38:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430740981] [2024-05-03 05:38:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:38:23,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-03 05:38:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:23,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-03 05:38:23,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-03 05:38:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:23,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:23,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,098 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:23,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,196 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,196 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,225 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,225 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,225 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,246 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,247 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,247 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,268 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,268 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,269 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,284 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,287 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,288 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,307 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,307 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,308 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,334 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,335 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,335 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,351 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,351 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,351 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,367 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,368 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,368 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,396 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,396 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,396 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,419 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,419 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,419 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,438 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,439 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,439 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,529 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,529 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,530 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:23,544 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 830 states. [2024-05-03 05:38:23,545 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:38:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:23,546 INFO L78 Accepts]: Start accepts. Automaton has currently 914 states, but on-demand construction may add more states Word has length 115 [2024-05-03 05:38:23,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:23,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 05:38:23,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:23,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -660677086, now seen corresponding path program 1 times [2024-05-03 05:38:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:23,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865953058] [2024-05-03 05:38:23,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 05:38:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:23,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865953058] [2024-05-03 05:38:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865953058] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:38:23,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:38:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 05:38:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756646032] [2024-05-03 05:38:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:38:23,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 05:38:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 05:38:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-05-03 05:38:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:23,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:23,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:23,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:23,866 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:23,989 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,989 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:23,989 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,006 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,006 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,006 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,032 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,032 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,033 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,056 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,056 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,056 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,077 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,077 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,077 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,101 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,101 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,101 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,126 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,126 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,127 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,144 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,144 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,144 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,159 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,160 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,160 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,192 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,192 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,192 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,214 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,214 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,214 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,229 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,229 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,229 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,307 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:24,308 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:24,308 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:24,319 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 838 states. [2024-05-03 05:38:24,319 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:38:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:24,319 INFO L78 Accepts]: Start accepts. Automaton has currently 922 states, but on-demand construction may add more states Word has length 123 [2024-05-03 05:38:24,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:24,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 05:38:24,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:24,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 196199955, now seen corresponding path program 1 times [2024-05-03 05:38:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127553652] [2024-05-03 05:38:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 05:38:24,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127553652] [2024-05-03 05:38:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127553652] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:38:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888125407] [2024-05-03 05:38:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:38:24,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:38:24,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 05:38:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:25,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2024-05-03 05:38:25,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:38:25,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-03 05:38:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 05:38:25,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:38:25,594 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:38:25,596 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 7 [2024-05-03 05:38:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 05:38:25,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888125407] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:38:25,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:38:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 9] total 17 [2024-05-03 05:38:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990084647] [2024-05-03 05:38:25,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:38:25,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-03 05:38:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:25,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-03 05:38:25,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-05-03 05:38:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:25,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:25,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:25,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:25,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:25,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:25,706 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:25,950 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:25,951 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:25,951 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,085 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,085 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,086 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,143 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,143 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,143 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,160 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,161 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,161 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,172 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,172 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,172 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,183 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,183 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,183 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,204 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,204 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,204 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,221 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,222 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,222 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,235 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,235 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,235 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,301 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:26,301 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:26,301 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:26,333 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 772 states. [2024-05-03 05:38:26,334 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:38:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:38:26,334 INFO L78 Accepts]: Start accepts. Automaton has currently 856 states, but on-demand construction may add more states Word has length 136 [2024-05-03 05:38:26,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:26,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 05:38:26,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:26,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:26,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:26,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1796901562, now seen corresponding path program 2 times [2024-05-03 05:38:26,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:26,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410772847] [2024-05-03 05:38:26,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 05:38:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410772847] [2024-05-03 05:38:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410772847] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:38:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508217158] [2024-05-03 05:38:26,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:38:26,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:26,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:38:26,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:38:26,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 05:38:27,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:38:27,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:38:27,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 39 conjunts are in the unsatisfiable core [2024-05-03 05:38:27,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:38:28,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-03 05:38:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:38:28,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:38:28,266 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:38:28,267 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 7 [2024-05-03 05:38:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:38:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508217158] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:38:29,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:38:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 17] total 41 [2024-05-03 05:38:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660602981] [2024-05-03 05:38:29,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:38:29,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-03 05:38:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-03 05:38:29,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2024-05-03 05:38:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:29,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.560975609756097) internal successors, (351), 41 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:29,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:29,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:29,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:29,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:38:29,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:29,241 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:30,047 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:30,048 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:30,048 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:30,734 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:30,735 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:30,735 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:38:31,289 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,289 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:31,289 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,302 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,302 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,302 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,346 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,347 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:31,347 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,356 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,357 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,357 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,384 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,384 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:31,384 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,398 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,401 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,401 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,422 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,423 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,423 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,438 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,438 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,438 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,454 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,454 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,454 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,473 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,474 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,474 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,502 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,502 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,502 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,521 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,521 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,521 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,547 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,547 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,548 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,569 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,569 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,569 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,588 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,588 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,588 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,608 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:31,608 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,609 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:31,653 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1458 states. [2024-05-03 05:38:31,654 INFO L212 cStratifiedReduction]: Copied states 129 times. [2024-05-03 05:38:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:38:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:38:31,654 INFO L78 Accepts]: Start accepts. Automaton has currently 1480 states, but on-demand construction may add more states Word has length 182 [2024-05-03 05:38:31,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:31,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 05:38:31,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:31,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:31,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash 467350487, now seen corresponding path program 1 times [2024-05-03 05:38:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138475548] [2024-05-03 05:38:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:38:37,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138475548] [2024-05-03 05:38:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138475548] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:38:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048697677] [2024-05-03 05:38:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:37,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:37,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:38:37,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:38:37,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 05:38:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:38,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 49 conjunts are in the unsatisfiable core [2024-05-03 05:38:38,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:38:39,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:38:39,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2024-05-03 05:38:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:38:39,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:38:40,342 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-05-03 05:38:40,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2024-05-03 05:38:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:38:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048697677] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:38:40,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:38:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 25, 17] total 75 [2024-05-03 05:38:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375208852] [2024-05-03 05:38:40,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:38:40,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-05-03 05:38:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-05-03 05:38:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=5283, Unknown=0, NotChecked=0, Total=5550 [2024-05-03 05:38:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:40,616 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:40,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 6.453333333333333) internal successors, (484), 75 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:40,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:40,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:40,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:40,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:38:40,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:38:40,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:40,617 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:43,995 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:43,995 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:43,996 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,004 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:44,004 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,004 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,335 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:44,335 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:44,335 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,343 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:44,343 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,343 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,600 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:44,600 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:44,600 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,641 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:44,642 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:44,642 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,211 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,211 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:45,211 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,219 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,219 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,502 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,503 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:45,503 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,514 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,514 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,514 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,528 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,528 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,528 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,540 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,540 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,540 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,551 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,551 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,551 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,570 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,570 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,570 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,585 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,585 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,585 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,597 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,597 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,597 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,611 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:45,611 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,611 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:45,724 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1435 states. [2024-05-03 05:38:45,724 INFO L212 cStratifiedReduction]: Copied states 215 times. [2024-05-03 05:38:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:38:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:38:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:38:45,725 INFO L78 Accepts]: Start accepts. Automaton has currently 1371 states, but on-demand construction may add more states Word has length 203 [2024-05-03 05:38:45,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:38:45,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 05:38:45,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:45,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:38:45,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:38:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash 550286147, now seen corresponding path program 2 times [2024-05-03 05:38:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:38:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391036620] [2024-05-03 05:38:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:38:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:38:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:38:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:38:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:38:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391036620] [2024-05-03 05:38:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391036620] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:38:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560391012] [2024-05-03 05:38:46,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:38:46,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:38:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:38:46,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:38:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 05:38:46,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:38:46,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:38:46,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-03 05:38:46,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:38:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:38:47,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:38:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:38:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560391012] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:38:48,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:38:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 44 [2024-05-03 05:38:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259478183] [2024-05-03 05:38:48,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:38:48,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-05-03 05:38:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:38:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-05-03 05:38:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2024-05-03 05:38:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:48,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:38:48,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 7.340909090909091) internal successors, (323), 44 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:38:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:38:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:38:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:38:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:38:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:38:48,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:38:48,741 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:38:51,491 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:51,491 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:51,491 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:51,501 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:51,502 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:51,502 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:51,780 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:51,780 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:51,780 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:51,791 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:51,791 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:51,792 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:52,076 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:52,076 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:52,077 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:52,085 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:52,086 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:52,086 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:53,353 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:53,354 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:53,354 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:53,362 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:53,362 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:53,362 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:54,516 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:54,517 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:38:54,517 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:38:54,524 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:54,524 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:38:54,524 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:00,050 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:00,050 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:00,050 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:00,058 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:00,058 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:00,058 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:13,049 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:13,049 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:13,049 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:13,060 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:13,060 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:13,061 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:13,978 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:13,978 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:13,978 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,008 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,008 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,008 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,028 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,028 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,028 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,050 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,051 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,051 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,066 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,067 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,067 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,081 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,081 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,081 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,108 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,108 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,108 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,130 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,130 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,130 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,146 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,146 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,146 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,259 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,260 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:14,261 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:39:18,181 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2082 states. [2024-05-03 05:39:18,181 INFO L212 cStratifiedReduction]: Copied states 322 times. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:39:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-05-03 05:39:18,182 INFO L78 Accepts]: Start accepts. Automaton has currently 1948 states, but on-demand construction may add more states Word has length 241 [2024-05-03 05:39:18,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:39:18,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-03 05:39:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-05-03 05:39:18,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:39:18,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:39:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2057885141, now seen corresponding path program 3 times [2024-05-03 05:39:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:39:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769737277] [2024-05-03 05:39:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:39:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:40:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:40:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:40:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769737277] [2024-05-03 05:40:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769737277] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:40:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672784659] [2024-05-03 05:40:12,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:40:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:40:12,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:40:12,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-03 05:40:13,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-03 05:40:13,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:40:13,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 83 conjunts are in the unsatisfiable core [2024-05-03 05:40:13,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:40:14,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-03 05:40:15,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 05:40:15,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 05:40:17,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:40:17,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 107 [2024-05-03 05:40:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:40:17,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:40:24,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:40:24,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 156 [2024-05-03 05:40:25,173 INFO L349 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2024-05-03 05:40:25,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 302 treesize of output 705 [2024-05-03 05:40:26,184 INFO L349 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2024-05-03 05:40:26,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 222 treesize of output 582 [2024-05-03 05:40:27,261 INFO L349 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2024-05-03 05:40:27,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 80 treesize of output 501 [2024-05-03 05:42:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-03 05:42:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672784659] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:42:43,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:42:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 40, 31] total 129 [2024-05-03 05:42:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834119775] [2024-05-03 05:42:43,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:42:43,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2024-05-03 05:42:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:42:43,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2024-05-03 05:42:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=15794, Unknown=95, NotChecked=0, Total=16512 [2024-05-03 05:42:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:43,293 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:42:43,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 5.108527131782946) internal successors, (659), 129 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-05-03 05:42:43,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:43,295 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:42:54,011 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:54,011 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:54,012 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:54,019 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:54,019 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:54,019 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:54,993 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:54,993 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:54,993 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:54,999 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:54,999 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:54,999 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:55,848 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:55,849 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:55,849 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:55,853 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:55,853 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:55,854 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:57,422 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:57,422 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:57,422 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:57,430 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:57,430 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:57,430 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:58,210 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:58,211 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:58,211 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:58,216 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:58,216 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:42:58,217 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:01,331 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:01,331 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:01,331 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:01,339 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:01,339 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:01,340 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:02,117 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,127 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,127 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,127 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,143 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,144 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,144 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,155 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,156 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,156 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,167 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,167 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,167 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,188 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,188 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,188 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,207 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,207 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,207 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,220 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,220 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,266 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:02,266 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,266 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:02,593 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1952 states. [2024-05-03 05:43:02,593 INFO L212 cStratifiedReduction]: Copied states 322 times. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-05-03 05:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-03 05:43:02,594 INFO L78 Accepts]: Start accepts. Automaton has currently 1818 states, but on-demand construction may add more states Word has length 262 [2024-05-03 05:43:02,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:43:02,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-03 05:43:02,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:43:02,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:43:02,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:43:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash 264875303, now seen corresponding path program 4 times [2024-05-03 05:43:02,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:43:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131888388] [2024-05-03 05:43:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:43:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:43:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:43:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:43:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:43:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131888388] [2024-05-03 05:43:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131888388] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:43:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057656578] [2024-05-03 05:43:04,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:43:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:43:04,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:43:04,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:43:04,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-03 05:43:04,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:43:04,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:43:04,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 48 conjunts are in the unsatisfiable core [2024-05-03 05:43:04,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:43:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:43:05,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:43:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:43:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057656578] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:43:09,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:43:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 27] total 64 [2024-05-03 05:43:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568843761] [2024-05-03 05:43:09,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:43:09,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-03 05:43:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:43:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-03 05:43:09,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=3671, Unknown=0, NotChecked=0, Total=4032 [2024-05-03 05:43:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:09,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:43:09,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 7.015625) internal successors, (449), 64 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:43:09,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:09,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-03 05:43:09,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:09,231 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:43:21,857 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:21,857 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:21,857 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:21,863 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:21,863 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:21,863 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:22,617 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:22,618 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:22,618 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:22,623 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:22,623 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:22,623 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:23,531 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:23,531 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:23,531 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:43:23,536 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:23,536 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:43:23,536 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:43:24,288 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:24,288 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:24,288 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:43:24,294 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:24,294 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:43:24,294 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:43:25,146 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:25,146 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:25,147 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:25,152 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:25,152 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:25,152 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:39,152 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 60 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:43:43,263 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:43,263 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:43,263 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:43,269 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:43,269 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:43,269 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:43:53,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:44:00,012 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:44:00,012 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:44:00,012 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:44:00,020 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:44:00,020 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:44:00,021 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:44:12,351 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 79 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:44:39,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:45:09,148 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:09,148 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:09,148 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:45:09,154 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:09,154 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:45:09,154 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:46:14,176 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1544 states. [2024-05-03 05:46:14,177 INFO L212 cStratifiedReduction]: Copied states 368 times. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-03 05:46:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-05-03 05:46:14,177 INFO L78 Accepts]: Start accepts. Automaton has currently 1221 states, but on-demand construction may add more states Word has length 313 [2024-05-03 05:46:14,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:46:14,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-05-03 05:46:14,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-03 05:46:14,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:46:14,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:46:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1399430868, now seen corresponding path program 5 times [2024-05-03 05:46:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:46:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126541557] [2024-05-03 05:46:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:46:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:46:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:46:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:46:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:46:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126541557] [2024-05-03 05:46:16,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126541557] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:46:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915849072] [2024-05-03 05:46:16,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 05:46:16,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:46:16,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:46:16,456 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:46:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-03 05:46:18,635 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-05-03 05:46:18,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:46:18,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 69 conjunts are in the unsatisfiable core [2024-05-03 05:46:18,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:46:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:46:21,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:46:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:46:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915849072] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:46:28,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:46:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 37] total 101 [2024-05-03 05:46:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309554656] [2024-05-03 05:46:28,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:46:28,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-05-03 05:46:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:46:28,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-05-03 05:46:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=987, Invalid=9113, Unknown=0, NotChecked=0, Total=10100 [2024-05-03 05:46:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:46:28,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:46:28,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 6.455445544554456) internal successors, (652), 101 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:46:28,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-05-03 05:46:28,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-03 05:46:28,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-05-03 05:46:28,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:46:28,382 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:46:56,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-05-03 05:47:31,109 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 95 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:47:33,005 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:33,006 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:33,006 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:33,011 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:33,011 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:33,011 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:34,785 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:34,786 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:34,786 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:34,791 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:34,791 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:34,791 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:38,040 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:38,040 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:38,040 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:38,045 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:38,045 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:38,045 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:42,919 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:42,919 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:42,919 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:42,924 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:42,924 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:42,924 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:46,005 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:46,005 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:46,005 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:46,010 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:46,010 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:46,010 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:49,290 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:49,291 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:49,291 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:49,296 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:49,296 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:47:49,296 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:48:03,680 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:03,681 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:03,681 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:48:03,686 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:03,686 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:48:03,686 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:48:18,353 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 68 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:48:26,209 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 58 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:48:44,571 WARN L293 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 76 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:49:01,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:49:03,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:49:13,563 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:13,563 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:13,563 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:49:13,568 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:13,568 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:49:13,568 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:49:38,333 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 79 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:49:40,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:50:14,312 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:14,313 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:50:14,313 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:50:14,318 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:14,318 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:50:14,318 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-03 05:50:40,687 WARN L293 SmtUtils]: Spent 11.13s on a formula simplification. DAG size of input: 85 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:51:05,313 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 79 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:51:38,908 WARN L293 SmtUtils]: Spent 16.55s on a formula simplification. DAG size of input: 101 DAG size of output: 86 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:51:41,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:51:45,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-05-03 05:52:02,502 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 05:52:02,502 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 05:52:02,502 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 05:52:02,613 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1675 states. [2024-05-03 05:52:02,613 INFO L212 cStratifiedReduction]: Copied states 414 times. [2024-05-03 05:52:02,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-03 05:52:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:52:02,813 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-13-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-12-2-1 context. [2024-05-03 05:52:02,818 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 05:52:02,831 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2024-05-03 05:52:02,833 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-03 05:52:02,835 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 05:52:02,835 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 05:52:02,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:52:02 BasicIcfg [2024-05-03 05:52:02,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 05:52:02,837 INFO L158 Benchmark]: Toolchain (without parser) took 822722.32ms. Allocated memory was 267.4MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 200.2MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 152.1MB. Max. memory is 8.0GB. [2024-05-03 05:52:02,838 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 137.6MB in the beginning and 137.6MB in the end (delta: 26.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:52:02,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.45ms. Allocated memory is still 267.4MB. Free memory was 199.6MB in the beginning and 188.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-03 05:52:02,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 267.4MB. Free memory was 187.6MB in the beginning and 186.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 05:52:02,838 INFO L158 Benchmark]: Boogie Preprocessor took 25.13ms. Allocated memory is still 267.4MB. Free memory was 186.0MB in the beginning and 184.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 05:52:02,839 INFO L158 Benchmark]: RCFGBuilder took 465.25ms. Allocated memory is still 267.4MB. Free memory was 184.4MB in the beginning and 166.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-05-03 05:52:02,839 INFO L158 Benchmark]: TraceAbstraction took 821937.01ms. Allocated memory was 267.4MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 165.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 117.5MB. Max. memory is 8.0GB. [2024-05-03 05:52:02,840 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 137.6MB in the beginning and 137.6MB in the end (delta: 26.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.45ms. Allocated memory is still 267.4MB. Free memory was 199.6MB in the beginning and 188.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 267.4MB. Free memory was 187.6MB in the beginning and 186.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.13ms. Allocated memory is still 267.4MB. Free memory was 186.0MB in the beginning and 184.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 465.25ms. Allocated memory is still 267.4MB. Free memory was 184.4MB in the beginning and 166.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 821937.01ms. Allocated memory was 267.4MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 165.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 117.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12078, independent: 10881, independent conditional: 10881, independent unconditional: 0, dependent: 1197, dependent conditional: 1197, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 10881, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 10881, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 0, independent unconditional: 10881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 0, independent unconditional: 10881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 0, independent unconditional: 10881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 0, independent unconditional: 10881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10881, independent: 10881, independent conditional: 0, independent unconditional: 10881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10881, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10881, unknown conditional: 0, unknown unconditional: 10881] , Statistics on independence cache: Total cache size (in pairs): 10881, Positive cache size: 10881, Positive conditional cache size: 0, Positive unconditional cache size: 10881, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1197 - StatisticsResult: Reduction benchmarks 36.2ms Time before loop, 785.9ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 744, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 13.6ms Time before loop, 368.6ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 807, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 10.9ms Time before loop, 434.7ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 830, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 73.8ms Time before loop, 378.2ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 838, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 77.1ms Time before loop, 550.3ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 13, Reduction States: 772, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 562.9ms Time before loop, 1848.8ms Time in loop, 2.4s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 21, Reduction States: 1458, Duplicate States: 129, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 2434.0ms Time before loop, 2672.8ms Time in loop, 5.1s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 20, Reduction States: 1435, Duplicate States: 215, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 2352.4ms Time before loop, 27088.0ms Time in loop, 29.4s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 27, Reduction States: 2082, Duplicate States: 322, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 7964.9ms Time before loop, 11333.7ms Time in loop, 19.3s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 24, Reduction States: 1952, Duplicate States: 322, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 6453.8ms Time before loop, 178491.4ms Time in loop, 184.9s Time in total, Has Loop: 1, wrong guesses: 8, overall guesses: 19, Reduction States: 1544, Duplicate States: 368, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 29934.3ms Time before loop, 304296.5ms Time in loop, 334.2s Time in total, Has Loop: 1, wrong guesses: 9, overall guesses: 19, Reduction States: 1675, Duplicate States: 414, Protected Variables: 6 - StatisticsResult: Visitor Statistics States: 726, Transitions: 809, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 726, Transitions: 814, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 739, Transitions: 828, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 746, Transitions: 835, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 678, Transitions: 758, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 1334, Transitions: 1514, Traversal time: 2.4s - StatisticsResult: Visitor Statistics States: 1308, Transitions: 1480, Traversal time: 5.1s - StatisticsResult: Visitor Statistics States: 1901, Transitions: 2133, Traversal time: 29.4s - StatisticsResult: Visitor Statistics States: 1771, Transitions: 1983, Traversal time: 19.3s - StatisticsResult: Visitor Statistics States: 1379, Transitions: 1534, Traversal time: 184.9s - StatisticsResult: Visitor Statistics States: 1502, Transitions: 1680, Traversal time: 334.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 39, RedundantProofs: 8, ProvenStates: 1177, Times there's more than one choice: 1040, Avg number of choices: 5.9940526762956665 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-13-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-12-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 230 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 821.7s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 578.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 589, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 237.3s InterpolantComputationTime, 3244 NumberOfCodeBlocks, 3244 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4680 ConstructedInterpolants, 21 QuantifiedInterpolants, 79425 SizeOfPredicates, 185 NumberOfNonLiveVariables, 2683 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 430/3457 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown