/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 -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 03:24:26,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 03:24:26,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 03:24:26,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 03:24:26,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 03:24:26,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 03:24:26,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 03:24:26,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 03:24:26,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 03:24:26,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 03:24:26,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 03:24:26,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 03:24:26,476 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 03:24:26,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 03:24:26,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 03:24:26,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 03:24:26,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 03:24:26,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 03:24:26,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 03:24:26,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 03:24:26,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 03:24:26,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 03:24:26,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 03:24:26,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 03:24:26,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 03:24:26,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 03:24:26,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 03:24:26,481 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 03:24:26,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 03:24:26,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 03:24:26,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 03:24:26,483 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 03:24:26,484 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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-05-05 03:24:26,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 03:24:26,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 03:24:26,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 03:24:26,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 03:24:26,725 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 03:24:26,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-05 03:24:27,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 03:24:27,951 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 03:24:27,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-05 03:24:27,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/12ce7e29b/c1db1d042b9942ec93b8c1eaaa6eaad5/FLAG0dd17ac1f [2024-05-05 03:24:27,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/12ce7e29b/c1db1d042b9942ec93b8c1eaaa6eaad5 [2024-05-05 03:24:27,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 03:24:27,979 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 03:24:27,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 03:24:27,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 03:24:27,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 03:24:27,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 03:24:27" (1/1) ... [2024-05-05 03:24:27,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8026838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:27, skipping insertion in model container [2024-05-05 03:24:27,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 03:24:27" (1/1) ... [2024-05-05 03:24:28,003 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 03:24:28,128 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2024-05-05 03:24:28,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 03:24:28,145 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 03:24:28,165 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2024-05-05 03:24:28,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 03:24:28,173 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 03:24:28,173 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 03:24:28,179 INFO L206 MainTranslator]: Completed translation [2024-05-05 03:24:28,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28 WrapperNode [2024-05-05 03:24:28,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 03:24:28,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 03:24:28,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 03:24:28,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 03:24:28,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,211 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 243 [2024-05-05 03:24:28,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 03:24:28,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 03:24:28,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 03:24:28,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 03:24:28,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 03:24:28,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 03:24:28,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 03:24:28,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 03:24:28,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (1/1) ... [2024-05-05 03:24:28,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 03:24:28,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:24:28,267 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-05 03:24:28,274 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-05 03:24:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 03:24:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 03:24:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 03:24:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 03:24:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-05 03:24:28,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-05 03:24:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-05 03:24:28,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-05 03:24:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-05 03:24:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-05 03:24:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 03:24:28,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 03:24:28,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 03:24:28,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-05 03:24:28,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 03:24:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 03:24:28,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 03:24:28,309 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 03:24:28,384 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 03:24:28,386 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 03:24:28,690 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 03:24:28,750 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 03:24:28,750 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2024-05-05 03:24:28,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 03:24:28 BoogieIcfgContainer [2024-05-05 03:24:28,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 03:24:28,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 03:24:28,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 03:24:28,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 03:24:28,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 03:24:27" (1/3) ... [2024-05-05 03:24:28,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289d4f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 03:24:28, skipping insertion in model container [2024-05-05 03:24:28,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:24:28" (2/3) ... [2024-05-05 03:24:28,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289d4f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 03:24:28, skipping insertion in model container [2024-05-05 03:24:28,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 03:24:28" (3/3) ... [2024-05-05 03:24:28,759 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2024-05-05 03:24:28,765 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 03:24:28,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 03:24:28,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 03:24:28,772 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 03:24:28,822 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-05 03:24:28,856 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 03:24:28,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 03:24:28,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:24:28,859 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-05 03:24:28,862 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-05 03:24:28,910 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 03:24:28,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:28,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 03:24:28,931 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=LoopHeads, 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;@2066bdcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-05 03:24:28,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-05 03:24:29,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:29,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash 941376213, now seen corresponding path program 1 times [2024-05-05 03:24:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254207835] [2024-05-05 03:24:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:29,349 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-05 03:24:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254207835] [2024-05-05 03:24:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254207835] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 03:24:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305550212] [2024-05-05 03:24:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 03:24:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 03:24:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 03:24:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:29,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:29,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 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-05 03:24:29,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:29,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 03:24:29,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:29,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash -467458075, now seen corresponding path program 1 times [2024-05-05 03:24:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:29,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608927092] [2024-05-05 03:24:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:29,843 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-05 03:24:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608927092] [2024-05-05 03:24:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608927092] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:29,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:29,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-05 03:24:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569103633] [2024-05-05 03:24:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:29,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-05 03:24:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:29,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-05 03:24:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-05 03:24:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:29,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:29,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-05 03:24:29,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:29,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:30,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:30,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-05 03:24:30,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:30,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 120148031, now seen corresponding path program 1 times [2024-05-05 03:24:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954205010] [2024-05-05 03:24:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:24:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954205010] [2024-05-05 03:24:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954205010] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:24:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844917069] [2024-05-05 03:24:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:31,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:24:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:24:31,345 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-05 03:24:31,346 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-05 03:24:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:31,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 61 conjunts are in the unsatisfiable core [2024-05-05 03:24:31,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:24:31,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-05 03:24:31,585 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-05 03:24:31,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-05-05 03:24:31,957 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-05 03:24:31,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-05-05 03:24:32,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-05 03:24:32,935 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-05 03:24:33,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-05 03:24:33,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-05 03:24:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:24:33,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:24:33,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))))) (or (< c_~n~0 (+ .cse0 1)) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse0))) c_~i~0) (< .cse0 0))))) is different from false [2024-05-05 03:24:34,118 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (< .cse0 0) (< c_~n~0 (+ .cse0 1)) (< c_~n~0 (+ (select .cse1 (+ (* .cse0 4) c_~f~0.offset)) 2)))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1))))))) is different from false [2024-05-05 03:24:34,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) is different from false [2024-05-05 03:24:34,764 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2024-05-05 03:24:34,984 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-05-05 03:24:35,012 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-05-05 03:24:38,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:38,830 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 130 treesize of output 94 [2024-05-05 03:24:38,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:38,842 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 1012 [2024-05-05 03:24:38,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:38,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 480 treesize of output 404 [2024-05-05 03:24:38,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:38,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2024-05-05 03:24:38,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:38,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 175 [2024-05-05 03:24:39,749 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-05 03:24:39,750 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 128 treesize of output 1 [2024-05-05 03:24:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:24:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844917069] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:24:40,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:24:40,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31, 28] total 73 [2024-05-05 03:24:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97546262] [2024-05-05 03:24:40,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:24:40,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-05-05 03:24:40,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:40,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-05-05 03:24:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3853, Unknown=55, NotChecked=810, Total=5256 [2024-05-05 03:24:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:40,231 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:40,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 5.890410958904109) internal successors, (430), 73 states have internal predecessors, (430), 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-05 03:24:40,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:40,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:40,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:40,322 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~f~0.base)) (.cse14 (+ c_~f~0.offset (* c_~j~0 4)))) (let ((.cse0 (select .cse9 .cse14)) (.cse21 (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse27 (select .cse26 .cse14))) (or (< c_~n~0 (+ 2 (select .cse26 (+ (* .cse27 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse27 1)) (< .cse27 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse28 (select .cse29 .cse14))) (or (< c_~n~0 (+ .cse28 1)) (< (select .cse29 (+ (* .cse28 4) c_~f~0.offset)) 1) (< .cse28 0))))))) (.cse5 (< c_~n~0 1)) (.cse6 (= c_~n~0 1))) (and (or (< c_~j~0 0) (< c_~n~0 (+ c_~j~0 1)) (= .cse0 c_~i~0)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse2 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< c_~n~0 (+ .cse1 1)) (< .cse1 0) (< c_~n~0 (+ (select .cse2 (+ (* .cse1 4) c_~f~0.offset)) 2)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< c_~n~0 (+ (select .cse4 (+ (* .cse3 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 2)))))) (< c_~n~0 (+ ~i~0 1)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8|) 0)))) .cse5 .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse8 (select .cse7 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< (select .cse7 (+ (* .cse8 4) c_~f~0.offset)) 1) (< c_~n~0 (+ .cse8 1)) (< .cse8 0))))))) (or (< c_~n~0 (+ .cse0 1)) (< .cse0 0) (= c_~i~0 (select .cse9 (+ c_~f~0.offset (* .cse0 4))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse10 (select .cse11 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse10 0) (< (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1) (< c_~n~0 (+ .cse10 1)))))))) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse13 (select .cse12 .cse14))) (or (< (select .cse12 (+ c_~f~0.offset (* 4 .cse13))) 1) (< c_~n~0 (+ .cse13 1)) (< .cse13 0))))) (or (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse16 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse15 0) (< (select .cse16 (+ (* .cse15 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< c_~n~0 (+ .cse15 1)))))) (< c_~n~0 (+ ~i~0 1)))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse18 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse17 0) (< (select .cse18 (+ (* .cse17 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1) (< c_~n~0 (+ .cse17 1)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse20 (select .cse19 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~n~0 (+ 2 (select .cse19 (+ (* .cse20 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< .cse20 0) (< c_~n~0 (+ .cse20 1)))))))) (or .cse21 (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) (or .cse21 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse23 (select .cse22 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~n~0 (+ (select .cse22 (+ (* .cse23 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (< .cse23 0) (< c_~n~0 (+ .cse23 1)))))))) (or .cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse24 (select .cse25 .cse14))) (or (< c_~n~0 (+ .cse24 1)) (< c_~n~0 (+ (select .cse25 (+ c_~f~0.offset (* 4 .cse24))) 2)) (< .cse24 0)))))))) is different from false [2024-05-05 03:24:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:41,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-05 03:24:42,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-05 03:24:42,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:42,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:42,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1785299303, now seen corresponding path program 2 times [2024-05-05 03:24:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:42,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613841068] [2024-05-05 03:24:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:24:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613841068] [2024-05-05 03:24:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613841068] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:24:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513794043] [2024-05-05 03:24:44,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 03:24:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:24:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:24:44,253 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-05 03:24:44,255 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-05 03:24:44,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-05 03:24:44,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:24:44,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-05 03:24:44,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:24:44,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-05 03:24:44,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-05 03:24:44,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-05 03:24:45,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 03:24:45,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-05-05 03:24:45,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-05-05 03:24:45,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:45,451 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-05-05 03:24:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:45,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-05 03:24:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513794043] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:45,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-05 03:24:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [32] total 48 [2024-05-05 03:24:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280870402] [2024-05-05 03:24:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:45,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-05 03:24:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:45,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-05 03:24:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2024-05-05 03:24:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:45,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:45,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 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-05 03:24:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:47,123 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-05 03:24:47,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:24:47,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:47,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash -402900861, now seen corresponding path program 3 times [2024-05-05 03:24:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:47,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608685746] [2024-05-05 03:24:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608685746] [2024-05-05 03:24:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608685746] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:47,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:47,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 03:24:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862225181] [2024-05-05 03:24:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:47,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 03:24:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:47,488 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 35 treesize of output 27 [2024-05-05 03:24:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash -447016435, now seen corresponding path program 1 times [2024-05-05 03:24:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:47,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:47,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 03:24:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-05 03:24:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-05 03:24:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:47,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:47,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-05 03:24:47,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:47,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:47,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:47,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:47,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:47,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5 [2024-05-05 03:24:47,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:47,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1178618859, now seen corresponding path program 4 times [2024-05-05 03:24:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096255647] [2024-05-05 03:24:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:47,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:47,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096255647] [2024-05-05 03:24:47,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096255647] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:47,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:47,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 03:24:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343961571] [2024-05-05 03:24:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:47,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 03:24:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1948868702, now seen corresponding path program 1 times [2024-05-05 03:24:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:48,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 03:24:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:48,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 03:24:48,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-05 03:24:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-05 03:24:48,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:48,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:48,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:48,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:48,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2024-05-05 03:24:48,156 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:48,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -53267319, now seen corresponding path program 5 times [2024-05-05 03:24:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547413647] [2024-05-05 03:24:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547413647] [2024-05-05 03:24:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547413647] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:48,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:48,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-05 03:24:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846315251] [2024-05-05 03:24:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:48,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-05 03:24:48,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-05 03:24:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-05 03:24:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:48,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 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-05 03:24:48,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:48,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:48,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:48,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:48,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-05 03:24:48,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:48,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash 684790823, now seen corresponding path program 6 times [2024-05-05 03:24:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:48,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127693600] [2024-05-05 03:24:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127693600] [2024-05-05 03:24:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127693600] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 03:24:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38501827] [2024-05-05 03:24:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:48,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 03:24:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1948868702, now seen corresponding path program 2 times [2024-05-05 03:24:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:48,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 03:24:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:48,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 03:24:48,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-05 03:24:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:48,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:48,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-05-05 03:24:48,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:48,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1756952055, now seen corresponding path program 7 times [2024-05-05 03:24:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:48,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34658637] [2024-05-05 03:24:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34658637] [2024-05-05 03:24:49,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34658637] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:49,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:24:49,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 03:24:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727432375] [2024-05-05 03:24:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:49,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 03:24:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 109054638, now seen corresponding path program 1 times [2024-05-05 03:24:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:49,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 03:24:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:24:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-05 03:24:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-05 03:24:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:49,143 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:49,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:49,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:49,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2024-05-05 03:24:49,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-05 03:24:49,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:24:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 365871679, now seen corresponding path program 8 times [2024-05-05 03:24:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:24:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037326714] [2024-05-05 03:24:49,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:24:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:24:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:24:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:24:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:24:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037326714] [2024-05-05 03:24:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037326714] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:24:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287724868] [2024-05-05 03:24:50,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 03:24:50,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:24:50,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:24:50,703 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-05 03:24:50,718 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-05 03:24:50,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-05 03:24:50,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:24:50,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-05 03:24:50,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:24:50,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-05 03:24:50,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-05 03:24:50,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-05 03:24:51,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-05-05 03:24:51,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 03:24:51,455 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-05-05 03:24:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:24:51,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-05 03:24:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287724868] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:24:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-05 03:24:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [30] total 44 [2024-05-05 03:24:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544175787] [2024-05-05 03:24:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:24:51,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-05 03:24:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:24:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-05 03:24:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1754, Unknown=0, NotChecked=0, Total=1892 [2024-05-05 03:24:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:51,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:24:51,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.3) internal successors, (166), 20 states have internal predecessors, (166), 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-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:51,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 03:24:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 03:24:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-05 03:24:56,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-05 03:24:56,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-05 03:24:56,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-05 03:24:56,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-05 03:24:56,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-05 03:24:56,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:24:56,725 INFO L448 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1] [2024-05-05 03:24:56,727 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 03:24:56,727 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 03:24:56,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 03:24:56 BasicIcfg [2024-05-05 03:24:56,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 03:24:56,729 INFO L158 Benchmark]: Toolchain (without parser) took 28750.94ms. Allocated memory was 302.0MB in the beginning and 906.0MB in the end (delta: 604.0MB). Free memory was 231.4MB in the beginning and 424.7MB in the end (delta: -193.3MB). Peak memory consumption was 411.2MB. Max. memory is 8.0GB. [2024-05-05 03:24:56,730 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 302.0MB. Free memory is still 269.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 03:24:56,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.46ms. Allocated memory is still 302.0MB. Free memory was 231.4MB in the beginning and 218.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-05 03:24:56,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.36ms. Allocated memory is still 302.0MB. Free memory was 218.9MB in the beginning and 216.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 03:24:56,730 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 302.0MB. Free memory was 216.5MB in the beginning and 214.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 03:24:56,730 INFO L158 Benchmark]: RCFGBuilder took 517.15ms. Allocated memory is still 302.0MB. Free memory was 214.7MB in the beginning and 253.1MB in the end (delta: -38.4MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2024-05-05 03:24:56,730 INFO L158 Benchmark]: TraceAbstraction took 27975.80ms. Allocated memory was 302.0MB in the beginning and 906.0MB in the end (delta: 604.0MB). Free memory was 252.0MB in the beginning and 424.7MB in the end (delta: -172.7MB). Peak memory consumption was 430.8MB. Max. memory is 8.0GB. [2024-05-05 03:24:56,735 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.39ms. Allocated memory is still 302.0MB. Free memory is still 269.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.46ms. Allocated memory is still 302.0MB. Free memory was 231.4MB in the beginning and 218.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.36ms. Allocated memory is still 302.0MB. Free memory was 218.9MB in the beginning and 216.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 302.0MB. Free memory was 216.5MB in the beginning and 214.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 517.15ms. Allocated memory is still 302.0MB. Free memory was 214.7MB in the beginning and 253.1MB in the end (delta: -38.4MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 27975.80ms. Allocated memory was 302.0MB in the beginning and 906.0MB in the end (delta: 604.0MB). Free memory was 252.0MB in the beginning and 424.7MB in the end (delta: -172.7MB). Peak memory consumption was 430.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 98807, independent: 98644, independent conditional: 98632, independent unconditional: 12, dependent: 163, dependent conditional: 163, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 98719, independent: 98644, independent conditional: 98632, independent unconditional: 12, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98719, independent: 98644, independent conditional: 98632, independent unconditional: 12, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98719, independent: 98644, independent conditional: 98632, independent unconditional: 12, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99432, independent: 98644, independent conditional: 663, independent unconditional: 97981, dependent: 788, dependent conditional: 476, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99432, independent: 98644, independent conditional: 479, independent unconditional: 98165, dependent: 788, dependent conditional: 92, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99432, independent: 98644, independent conditional: 479, independent unconditional: 98165, dependent: 788, dependent conditional: 92, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 709, independent: 673, independent conditional: 35, independent unconditional: 638, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 29, independent conditional: 26, independent unconditional: 4, dependent: 84, dependent conditional: 22, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 99432, independent: 97971, independent conditional: 444, independent unconditional: 97527, dependent: 752, dependent conditional: 73, dependent unconditional: 679, unknown: 709, unknown conditional: 54, unknown unconditional: 655] , Statistics on independence cache: Total cache size (in pairs): 709, Positive cache size: 673, Positive conditional cache size: 35, Positive unconditional cache size: 638, Negative cache size: 36, Negative conditional cache size: 19, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 568, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99432, independent: 98644, independent conditional: 663, independent unconditional: 97981, dependent: 788, dependent conditional: 476, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99432, independent: 98644, independent conditional: 479, independent unconditional: 98165, dependent: 788, dependent conditional: 92, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99432, independent: 98644, independent conditional: 479, independent unconditional: 98165, dependent: 788, dependent conditional: 92, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 709, independent: 673, independent conditional: 35, independent unconditional: 638, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 29, independent conditional: 26, independent unconditional: 4, dependent: 84, dependent conditional: 22, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 99432, independent: 97971, independent conditional: 444, independent unconditional: 97527, dependent: 752, dependent conditional: 73, dependent unconditional: 679, unknown: 709, unknown conditional: 54, unknown unconditional: 655] , Statistics on independence cache: Total cache size (in pairs): 709, Positive cache size: 673, Positive conditional cache size: 35, Positive unconditional cache size: 638, Negative cache size: 36, Negative conditional cache size: 19, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 568 ], Independence queries for same thread: 88 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 220 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 9.8s, 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: 156, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 2219 NumberOfCodeBlocks, 2187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2371 ConstructedInterpolants, 88 QuantifiedInterpolants, 24203 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1043 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 70/93 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, ConditionalCommutativityCheckTime: 0.4s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 5, ConditionalCommutativityTraceChecks: 4, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-05 03:24:56,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-05 03:24:56,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...