/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:48:48,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:48:48,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:48:48,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:48:48,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:48:48,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:48:48,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:48:48,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:48:48,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:48:48,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:48:48,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:48:48,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:48:48,070 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:48:48,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:48:48,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:48:48,070 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:48:48,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:48:48,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:48:48,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:48:48,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:48:48,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:48:48,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:48:48,072 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:48:48,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:48:48,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:48:48,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:48:48,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:48:48,073 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:48:48,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:48:48,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:48:48,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:48:48,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:48:48,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:48:48,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:48:48,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:48:48,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:48:48,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:48:48,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:48:48,075 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:48:48,075 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:48:48,075 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP [2023-11-17 18:48:48,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:48:48,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:48:48,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:48:48,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:48:48,318 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:48:48,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-11-17 18:48:49,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:48:49,429 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:48:49,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-11-17 18:48:49,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848b7bac8/c2243dc1a07445b79da3ab67fe242b73/FLAGb58662bd8 [2023-11-17 18:48:49,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848b7bac8/c2243dc1a07445b79da3ab67fe242b73 [2023-11-17 18:48:49,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:48:49,458 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:48:49,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:48:49,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:48:49,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:48:49,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667f40e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49, skipping insertion in model container [2023-11-17 18:48:49,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,487 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:48:49,620 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/unroll-cond-5.wvr.c[3001,3014] [2023-11-17 18:48:49,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:48:49,633 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:48:49,648 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/unroll-cond-5.wvr.c[3001,3014] [2023-11-17 18:48:49,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:48:49,667 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:48:49,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49 WrapperNode [2023-11-17 18:48:49,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:48:49,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:48:49,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:48:49,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:48:49,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,697 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 209 [2023-11-17 18:48:49,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:48:49,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:48:49,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:48:49,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:48:49,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:48:49,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:48:49,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:48:49,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:48:49,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (1/1) ... [2023-11-17 18:48:49,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:48:49,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:48:49,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 18:48:49,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 18:48:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:48:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:48:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:48:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:48:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:48:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:48:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:48:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:48:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:48:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:48:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:48:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:48:49,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:48:49,812 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 18:48:49,899 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:48:49,901 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:48:50,194 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:48:50,204 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:48:50,205 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 18:48:50,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:48:50 BoogieIcfgContainer [2023-11-17 18:48:50,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:48:50,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:48:50,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:48:50,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:48:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:48:49" (1/3) ... [2023-11-17 18:48:50,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bec8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:48:50, skipping insertion in model container [2023-11-17 18:48:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:48:49" (2/3) ... [2023-11-17 18:48:50,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bec8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:48:50, skipping insertion in model container [2023-11-17 18:48:50,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:48:50" (3/3) ... [2023-11-17 18:48:50,212 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2023-11-17 18:48:50,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:48:50,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:48:50,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:48:50,224 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:48:50,341 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 18:48:50,423 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:48:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:48:50,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:48:50,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 18:48:50,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 18:48:50,460 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:48:50,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:48:50,473 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;@14ce5bba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:48:50,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 18:48:50,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:48:50,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:48:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1660528264, now seen corresponding path program 1 times [2023-11-17 18:48:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:48:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239067374] [2023-11-17 18:48:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:48:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:48:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:48:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:48:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:48:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239067374] [2023-11-17 18:48:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239067374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:48:50,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:48:50,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:48:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991149293] [2023-11-17 18:48:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:48:50,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:48:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:48:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:48:50,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:48:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:50,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:48:50,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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) [2023-11-17 18:48:50,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:51,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:48:51,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:48:51,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:48:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1954065100, now seen corresponding path program 1 times [2023-11-17 18:48:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:48:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125366536] [2023-11-17 18:48:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:48:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:48:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:48:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:48:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:48:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125366536] [2023-11-17 18:48:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125366536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:48:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472709738] [2023-11-17 18:48:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:48:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:48:51,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:48:51,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:48:51,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 18:48:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:48:52,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 18:48:52,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:48:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:48:52,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 18:48:52,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472709738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:48:52,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 18:48:52,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-11-17 18:48:52,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657759955] [2023-11-17 18:48:52,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:48:52,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 18:48:52,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:48:52,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 18:48:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2023-11-17 18:48:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:52,323 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:48:52,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 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) [2023-11-17 18:48:52,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:52,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:48:52,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 18:48:52,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-17 18:48:52,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:48:52,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:48:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash -441213083, now seen corresponding path program 1 times [2023-11-17 18:48:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:48:52,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086202090] [2023-11-17 18:48:52,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:48:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:48:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:48:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:48:53,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:48:53,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086202090] [2023-11-17 18:48:53,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086202090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:48:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975760769] [2023-11-17 18:48:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:48:53,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:48:53,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:48:53,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:48:53,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 18:48:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:48:53,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 18:48:53,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:48:54,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-17 18:48:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:48:54,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:48:55,059 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 18:48:55,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-11-17 18:48:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:48:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975760769] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:48:55,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:48:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26, 20] total 50 [2023-11-17 18:48:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189263650] [2023-11-17 18:48:55,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:48:55,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-17 18:48:55,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:48:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-17 18:48:55,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2260, Unknown=0, NotChecked=0, Total=2450 [2023-11-17 18:48:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:55,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:48:55,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.62) internal successors, (431), 50 states have internal predecessors, (431), 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) [2023-11-17 18:48:55,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:55,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:48:55,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:48:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:48:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:48:57,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 18:48:57,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:48:57,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:48:57,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:48:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1546116394, now seen corresponding path program 2 times [2023-11-17 18:48:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:48:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056580282] [2023-11-17 18:48:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:48:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:48:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:48:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:48:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:48:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056580282] [2023-11-17 18:48:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056580282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:48:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126426541] [2023-11-17 18:48:57,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:48:57,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:48:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:48:57,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:48:57,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 18:48:57,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:48:57,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:48:57,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-17 18:48:57,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:48:58,572 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 19 treesize of output 1 [2023-11-17 18:48:58,910 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 [2023-11-17 18:48:59,025 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 [2023-11-17 18:49:00,595 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2023-11-17 18:49:00,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 48 [2023-11-17 18:49:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:49:00,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:49:05,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:49:05,119 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 496 treesize of output 292 [2023-11-17 18:49:05,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:49:05,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 1636 treesize of output 1532 [2023-11-17 18:49:05,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:49:05,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 369 treesize of output 337 [2023-11-17 18:49:06,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:49:06,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 268 treesize of output 344 [2023-11-17 18:49:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:49:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126426541] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:49:13,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:49:13,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 44, 40] total 92 [2023-11-17 18:49:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144987504] [2023-11-17 18:49:13,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:49:13,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2023-11-17 18:49:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:49:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2023-11-17 18:49:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=7748, Unknown=50, NotChecked=0, Total=8372 [2023-11-17 18:49:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:13,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:49:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 5.684782608695652) internal successors, (523), 92 states have internal predecessors, (523), 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) [2023-11-17 18:49:13,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:13,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:49:13,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:49:13,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:49:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:49:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:49:18,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 18:49:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:49:18,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:49:18,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:49:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 41809879, now seen corresponding path program 3 times [2023-11-17 18:49:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:49:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986187535] [2023-11-17 18:49:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:49:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:49:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:49:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:49:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:49:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986187535] [2023-11-17 18:49:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986187535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:49:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165305383] [2023-11-17 18:49:19,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:49:19,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:49:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:49:19,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:49:19,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 18:49:19,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 18:49:19,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:49:19,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-17 18:49:19,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:49:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:49:19,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:49:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:49:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165305383] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:49:20,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:49:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2023-11-17 18:49:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147050016] [2023-11-17 18:49:20,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:49:20,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 18:49:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:49:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 18:49:20,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2023-11-17 18:49:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:20,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:49:20,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.03225806451613) internal successors, (280), 31 states have internal predecessors, (280), 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) [2023-11-17 18:49:20,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:20,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:49:20,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:49:20,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:49:20,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:49:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:49:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:49:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:49:21,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 18:49:21,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:49:21,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:49:21,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:49:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1457404145, now seen corresponding path program 4 times [2023-11-17 18:49:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:49:21,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126535039] [2023-11-17 18:49:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:49:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:49:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:49:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:49:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:49:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126535039] [2023-11-17 18:49:48,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126535039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:49:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163895385] [2023-11-17 18:49:48,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 18:49:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:49:48,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:49:48,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:49:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 18:49:48,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 18:49:48,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:49:48,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-17 18:49:48,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:49:51,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:49:51,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 82 [2023-11-17 18:49:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:49:51,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:49:53,422 INFO L349 Elim1Store]: treesize reduction 20, result has 92.7 percent of original size [2023-11-17 18:49:53,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 124 treesize of output 312 [2023-11-17 18:49:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:49:56,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163895385] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:49:56,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:49:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 35, 34] total 112 [2023-11-17 18:49:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997825723] [2023-11-17 18:49:56,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:49:56,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2023-11-17 18:49:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:49:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2023-11-17 18:49:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=11581, Unknown=0, NotChecked=0, Total=12432 [2023-11-17 18:49:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:56,691 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:49:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 5.267857142857143) internal successors, (590), 112 states have internal predecessors, (590), 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) [2023-11-17 18:49:56,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:49:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:49:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:49:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:49:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:49:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:50:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:50:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:50:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:50:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:50:02,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 18:50:02,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:50:02,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:50:02,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:50:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1164747056, now seen corresponding path program 5 times [2023-11-17 18:50:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:50:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461672749] [2023-11-17 18:50:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:50:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:50:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:50:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 133 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:50:03,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461672749] [2023-11-17 18:50:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461672749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:50:03,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65709610] [2023-11-17 18:50:03,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 18:50:03,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:50:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:50:03,349 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:50:03,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 18:50:03,581 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-17 18:50:03,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:50:03,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 18:50:03,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:50:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:03,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:50:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 5 proven. 130 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65709610] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:50:04,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:50:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 43 [2023-11-17 18:50:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456018623] [2023-11-17 18:50:04,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:50:04,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-17 18:50:04,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:50:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-17 18:50:04,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2023-11-17 18:50:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:04,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:50:04,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.511627906976743) internal successors, (366), 43 states have internal predecessors, (366), 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) [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:50:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:50:05,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 18:50:05,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:50:05,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:50:05,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:50:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2143472015, now seen corresponding path program 1 times [2023-11-17 18:50:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:50:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930778634] [2023-11-17 18:50:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:50:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:50:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:50:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:50:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930778634] [2023-11-17 18:50:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930778634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:50:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482841022] [2023-11-17 18:50:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:50:06,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:50:06,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:50:06,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:50:07,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 18:50:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:50:07,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 18:50:07,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:50:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:08,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:50:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482841022] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:50:11,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:50:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 32] total 80 [2023-11-17 18:50:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962360135] [2023-11-17 18:50:11,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:50:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-17 18:50:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:50:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-17 18:50:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=5766, Unknown=0, NotChecked=0, Total=6320 [2023-11-17 18:50:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:11,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:50:11,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 7.15) internal successors, (572), 80 states have internal predecessors, (572), 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) [2023-11-17 18:50:11,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:11,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:50:11,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:50:11,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:50:11,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:50:11,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:50:11,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:50:11,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:50:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:50:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:50:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:50:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:50:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:50:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-17 18:50:33,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-17 18:50:33,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-17 18:50:33,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:50:33,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:50:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1396945799, now seen corresponding path program 2 times [2023-11-17 18:50:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:50:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123524967] [2023-11-17 18:50:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:50:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:50:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:50:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1028 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:50:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123524967] [2023-11-17 18:50:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123524967] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:50:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40807916] [2023-11-17 18:50:35,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:50:35,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:50:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:50:35,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:50:35,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 18:50:36,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:50:36,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:50:36,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-17 18:50:36,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:50:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1028 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:37,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:50:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1028 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:50:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40807916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:50:43,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:50:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43, 43] total 111 [2023-11-17 18:50:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763826573] [2023-11-17 18:50:43,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:50:43,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2023-11-17 18:50:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:50:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2023-11-17 18:50:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=10929, Unknown=0, NotChecked=0, Total=12210 [2023-11-17 18:50:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:43,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:50:43,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 7.126126126126126) internal successors, (791), 111 states have internal predecessors, (791), 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) [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-11-17 18:50:43,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:51:22,286 WARN L293 SmtUtils]: Spent 14.30s on a formula simplification. DAG size of input: 114 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:54:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-17 18:54:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2023-11-17 18:54:35,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 18:54:35,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:54:35,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 18:54:35,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:54:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2030906152, now seen corresponding path program 3 times [2023-11-17 18:54:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:54:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809549543] [2023-11-17 18:54:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:54:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:54:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:54:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:54:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:54:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809549543] [2023-11-17 18:54:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809549543] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:54:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183312480] [2023-11-17 18:54:39,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:54:39,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:54:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:54:39,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:54:39,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 18:54:55,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-11-17 18:54:55,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:54:55,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-17 18:54:55,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:55:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 834 proven. 1194 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-17 18:55:26,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:56:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 1264 proven. 752 refuted. 12 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-17 18:56:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183312480] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:56:53,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:56:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 69] total 184 [2023-11-17 18:56:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310255056] [2023-11-17 18:56:53,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:56:53,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 184 states [2023-11-17 18:56:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:56:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2023-11-17 18:56:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3119, Invalid=30552, Unknown=1, NotChecked=0, Total=33672 [2023-11-17 18:56:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:56:53,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:56:53,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 184 states, 184 states have (on average 6.570652173913044) internal successors, (1209), 184 states have internal predecessors, (1209), 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) [2023-11-17 18:56:53,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2023-11-17 18:56:53,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:56:55,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse37 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse36 (mod (+ 2 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296)) (.cse35 (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296)) (.cse24 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse32 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296)) (.cse5 (mod (+ 4 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296)) (.cse14 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296)) (.cse29 (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 1) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (.cse22 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse16 (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 3) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse17 (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 5) 4294967296)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296))) (let ((.cse11 (+ .cse10 1)) (.cse4 (+ .cse17 1)) (.cse8 (+ .cse9 1)) (.cse15 (+ .cse16 1)) (.cse7 (+ .cse22 1)) (.cse20 (+ .cse26 1)) (.cse19 (+ .cse29 1)) (.cse13 (+ .cse14 1)) (.cse6 (+ .cse5 1)) (.cse33 (+ .cse32 1)) (.cse12 (+ .cse24 1)) (.cse27 (+ .cse35 1)) (.cse30 (+ .cse36 1)) (.cse3 (mod (+ c_~n~0 4294967293) 4294967296)) (.cse23 (+ .cse37 1)) (.cse0 (mod c_~n~0 4294967296)) (.cse2 (mod (+ 4294967292 c_~n~0) 4294967296)) (.cse25 (+ .cse28 1))) (and (<= .cse0 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (let ((.cse1 (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 10) 4294967296))) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 13) 4294967296) 1)) (< .cse1 .cse2) (< .cse3 (+ .cse1 1)) (< .cse2 .cse4))) (or (< .cse5 .cse2) (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296) 1)) (< .cse3 .cse6)) (or (< .cse0 .cse7) (< .cse3 .cse8) (< .cse9 .cse2)) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse2 .cse8) (< .cse10 .cse2) (< .cse3 .cse11)) (< .cse0 .cse12) (or (< .cse3 .cse13) (< .cse0 .cse11) (< .cse14 .cse2)) (or (< .cse3 .cse15) (< .cse16 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 6) 4294967296) 1))) (or (< .cse3 .cse4) (< .cse17 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 8) 4294967296) 1))) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post16#1| 2) 4294967296) 1)) (let ((.cse18 (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 6) 4294967296))) (or (< .cse3 (+ .cse18 1)) (< .cse18 .cse2) (< .cse2 .cse19) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 9) 4294967296) 1)))) (< .cse0 .cse20) (< .cse0 .cse8) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post14#1| 3) 4294967296) 1)) (let ((.cse21 (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 8) 4294967296))) (or (< .cse3 (+ 1 .cse21)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 11) 4294967296) 1)) (< .cse2 .cse15) (< .cse21 .cse2))) (or (< .cse3 11) (< 10 .cse2)) (or (< .cse3 .cse7) (< .cse22 .cse2) (< .cse0 .cse23) (< .cse2 .cse20)) (or (< .cse24 .cse2) (< .cse0 .cse13) (< .cse3 .cse12)) (or (< .cse3 .cse20) (< .cse0 .cse25) (< .cse26 .cse2)) (or (< .cse0 .cse27) (< .cse3 .cse25) (< .cse28 .cse2)) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 4) 4294967296) 1)) (< .cse3 .cse19) (< .cse29 .cse2)) (let ((.cse31 (mod (+ 7 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296))) (or (< .cse2 .cse30) (< .cse31 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post10#1| 10) 4294967296) 1)) (< .cse3 (+ 1 .cse31)))) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post18#1| 1) 4294967296) 1)) (or (< .cse32 .cse2) (< .cse2 .cse13) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (< .cse3 .cse33)) (let ((.cse34 (mod (+ 9 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296))) (or (< .cse3 (+ .cse34 1)) (< .cse34 .cse2) (< .cse0 (+ (mod (+ 12 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296) 1)) (< .cse2 .cse6))) (or (< .cse35 .cse2) (< .cse0 .cse33) (< .cse2 .cse12) (< .cse3 .cse27)) (or (< .cse0 (+ (mod (+ 5 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296) 1)) (< .cse3 .cse30) (< .cse36 .cse2)) (or (< .cse37 .cse2) (< .cse3 .cse23) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse25))))) is different from false [2023-11-17 18:56:57,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse37 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse36 (mod (+ 2 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296)) (.cse35 (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296)) (.cse24 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse32 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296)) (.cse5 (mod (+ 4 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296)) (.cse14 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296)) (.cse29 (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 1) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (.cse22 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse16 (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 3) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse17 (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 5) 4294967296)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296))) (let ((.cse11 (+ .cse10 1)) (.cse4 (+ .cse17 1)) (.cse8 (+ .cse9 1)) (.cse15 (+ .cse16 1)) (.cse7 (+ .cse22 1)) (.cse20 (+ .cse26 1)) (.cse19 (+ .cse29 1)) (.cse13 (+ .cse14 1)) (.cse6 (+ .cse5 1)) (.cse33 (+ .cse32 1)) (.cse12 (+ .cse24 1)) (.cse27 (+ .cse35 1)) (.cse30 (+ .cse36 1)) (.cse3 (mod (+ c_~n~0 4294967293) 4294967296)) (.cse23 (+ .cse37 1)) (.cse0 (mod c_~n~0 4294967296)) (.cse2 (mod (+ 4294967292 c_~n~0) 4294967296)) (.cse25 (+ .cse28 1))) (and (<= .cse0 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (let ((.cse1 (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 10) 4294967296))) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 13) 4294967296) 1)) (< .cse1 .cse2) (< .cse3 (+ .cse1 1)) (< .cse2 .cse4))) (or (< .cse5 .cse2) (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296) 1)) (< .cse3 .cse6)) (or (< .cse0 .cse7) (< .cse3 .cse8) (< .cse9 .cse2)) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse2 .cse8) (< .cse10 .cse2) (< .cse3 .cse11)) (< .cse0 .cse12) (or (< .cse3 .cse13) (< .cse0 .cse11) (< .cse14 .cse2)) (or (< .cse3 .cse15) (< .cse16 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 6) 4294967296) 1))) (or (< .cse3 .cse4) (< .cse17 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 8) 4294967296) 1))) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post16#1| 2) 4294967296) 1)) (let ((.cse18 (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 6) 4294967296))) (or (< .cse3 (+ .cse18 1)) (< .cse18 .cse2) (< .cse2 .cse19) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 9) 4294967296) 1)))) (< .cse0 .cse20) (< .cse0 .cse8) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post14#1| 3) 4294967296) 1)) (let ((.cse21 (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 8) 4294967296))) (or (< .cse3 (+ 1 .cse21)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 11) 4294967296) 1)) (< .cse2 .cse15) (< .cse21 .cse2))) (or (< .cse3 11) (< 10 .cse2)) (or (< .cse3 .cse7) (< .cse22 .cse2) (< .cse0 .cse23) (< .cse2 .cse20)) (or (< .cse24 .cse2) (< .cse0 .cse13) (< .cse3 .cse12)) (or (< .cse3 .cse20) (< .cse0 .cse25) (< .cse26 .cse2)) (or (< .cse0 .cse27) (< .cse3 .cse25) (< .cse28 .cse2)) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 4) 4294967296) 1)) (< .cse3 .cse19) (< .cse29 .cse2)) (let ((.cse31 (mod (+ 7 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296))) (or (< .cse2 .cse30) (< .cse31 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post10#1| 10) 4294967296) 1)) (< .cse3 (+ 1 .cse31)))) (= |c_thread1Thread1of1ForFork1_~i~0#1| 0) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post18#1| 1) 4294967296) 1)) (or (< .cse32 .cse2) (< .cse2 .cse13) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (< .cse3 .cse33)) (let ((.cse34 (mod (+ 9 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296))) (or (< .cse3 (+ .cse34 1)) (< .cse34 .cse2) (< .cse0 (+ (mod (+ 12 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296) 1)) (< .cse2 .cse6))) (or (< .cse35 .cse2) (< .cse0 .cse33) (< .cse2 .cse12) (< .cse3 .cse27)) (or (< .cse0 (+ (mod (+ 5 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296) 1)) (< .cse3 .cse30) (< .cse36 .cse2)) (or (< .cse37 .cse2) (< .cse3 .cse23) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse25))))) is different from false [2023-11-17 18:57:02,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse37 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse36 (mod (+ 2 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296)) (.cse35 (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse32 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296)) (.cse5 (mod (+ 4 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296)) (.cse13 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296)) (.cse29 (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 1) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 3) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse16 (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 5) 4294967296)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296))) (let ((.cse11 (+ .cse10 1)) (.cse4 (+ .cse16 1)) (.cse8 (+ .cse9 1)) (.cse14 (+ .cse15 1)) (.cse7 (+ .cse20 1)) (.cse22 (+ .cse26 1)) (.cse18 (+ .cse29 1)) (.cse12 (+ .cse13 1)) (.cse6 (+ .cse5 1)) (.cse33 (+ .cse32 1)) (.cse24 (+ .cse23 1)) (.cse27 (+ .cse35 1)) (.cse30 (+ .cse36 1)) (.cse3 (mod (+ c_~n~0 4294967293) 4294967296)) (.cse21 (+ .cse37 1)) (.cse0 (mod c_~n~0 4294967296)) (.cse2 (mod (+ 4294967292 c_~n~0) 4294967296)) (.cse25 (+ .cse28 1))) (and (let ((.cse1 (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 10) 4294967296))) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 13) 4294967296) 1)) (< .cse1 .cse2) (< .cse3 (+ .cse1 1)) (< .cse2 .cse4))) (<= (+ (mod (+ 4294967294 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296) 1) .cse0) (or (< .cse5 .cse2) (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296) 1)) (< .cse3 .cse6)) (or (< .cse0 .cse7) (< .cse3 .cse8) (< .cse9 .cse2)) (<= (+ (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4294967293) 4294967296) 1) .cse0) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse2 .cse8) (< .cse10 .cse2) (< .cse3 .cse11)) (or (< .cse3 .cse12) (< .cse0 .cse11) (< .cse13 .cse2)) (or (< .cse3 .cse14) (< .cse15 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 6) 4294967296) 1))) (or (< .cse3 .cse4) (< .cse16 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 8) 4294967296) 1))) (let ((.cse17 (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 6) 4294967296))) (or (< .cse3 (+ .cse17 1)) (< .cse17 .cse2) (< .cse2 .cse18) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 9) 4294967296) 1)))) (or (< .cse0 .cse8) (< .cse3 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1))) (let ((.cse19 (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 8) 4294967296))) (or (< .cse3 (+ 1 .cse19)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post8#1| 11) 4294967296) 1)) (< .cse2 .cse14) (< .cse19 .cse2))) (<= (+ (mod (+ 4294967295 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296) 1) .cse0) (or (< .cse3 11) (< 10 .cse2)) (or (< .cse3 .cse7) (< .cse20 .cse2) (< .cse0 .cse21) (< .cse2 .cse22)) (or (< .cse23 .cse2) (< .cse0 .cse12) (< .cse3 .cse24)) (or (< .cse3 .cse22) (< .cse0 .cse25) (< .cse26 .cse2)) (or (< .cse0 .cse27) (< .cse3 .cse25) (< .cse28 .cse2)) (= 3 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 4) 4294967296) 1)) (< .cse3 .cse18) (< .cse29 .cse2)) (let ((.cse31 (mod (+ 7 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296))) (or (< .cse2 .cse30) (< .cse31 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post10#1| 10) 4294967296) 1)) (< .cse3 (+ 1 .cse31)))) (or (< .cse32 .cse2) (< .cse2 .cse12) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (< .cse3 .cse33)) (let ((.cse34 (mod (+ 9 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296))) (or (< .cse3 (+ .cse34 1)) (< .cse34 .cse2) (< .cse0 (+ (mod (+ 12 |c_thread2Thread1of1ForFork0_#t~post6#1|) 4294967296) 1)) (< .cse2 .cse6))) (or (< .cse35 .cse2) (< .cse0 .cse33) (< .cse2 .cse24) (< .cse3 .cse27)) (or (< .cse0 (+ (mod (+ 5 |c_thread2Thread1of1ForFork0_#t~post10#1|) 4294967296) 1)) (< .cse3 .cse30) (< .cse36 .cse2)) (or (< .cse37 .cse2) (< .cse3 .cse21) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse25))))) is different from false Received shutdown request... [2023-11-17 18:58:03,894 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:58:03,895 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:58:03,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:58:03,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 18:58:04,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 18:58:04,160 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 206 known predicates. [2023-11-17 18:58:04,162 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 18:58:04,162 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 18:58:04,162 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 18:58:04,179 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2023-11-17 18:58:04,182 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 18:58:04,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 18:58:04,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:58:04 BasicIcfg [2023-11-17 18:58:04,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 18:58:04,184 INFO L158 Benchmark]: Toolchain (without parser) took 554726.12ms. Allocated memory was 177.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 138.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 403.2MB. Max. memory is 8.0GB. [2023-11-17 18:58:04,184 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:58:04,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.73ms. Allocated memory is still 177.2MB. Free memory was 138.4MB in the beginning and 126.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 18:58:04,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.93ms. Allocated memory is still 177.2MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:58:04,184 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 177.2MB. Free memory was 123.8MB in the beginning and 121.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:58:04,185 INFO L158 Benchmark]: RCFGBuilder took 487.99ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 100.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-11-17 18:58:04,185 INFO L158 Benchmark]: TraceAbstraction took 553976.28ms. Allocated memory was 177.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 100.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 365.4MB. Max. memory is 8.0GB. [2023-11-17 18:58:04,186 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.10ms. Allocated memory is still 177.2MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.73ms. Allocated memory is still 177.2MB. Free memory was 138.4MB in the beginning and 126.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.93ms. Allocated memory is still 177.2MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 177.2MB. Free memory was 123.8MB in the beginning and 121.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.99ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 100.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 553976.28ms. Allocated memory was 177.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 100.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 365.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13832, independent: 13163, independent conditional: 7565, independent unconditional: 5598, dependent: 669, dependent conditional: 665, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 7565, independent unconditional: 5598, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 7565, independent unconditional: 5598, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 0, independent unconditional: 13163, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 0, independent unconditional: 13163, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 0, independent unconditional: 13163, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5340, independent: 5336, independent conditional: 0, independent unconditional: 5336, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5340, independent: 5335, independent conditional: 0, independent unconditional: 5335, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13167, independent: 7827, independent conditional: 0, independent unconditional: 7827, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5340, unknown conditional: 0, unknown unconditional: 5340] , Statistics on independence cache: Total cache size (in pairs): 5340, Positive cache size: 5336, Positive conditional cache size: 0, Positive unconditional cache size: 5336, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 665 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 240, Number of trivial persistent sets: 98, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5602, independent: 5598, independent conditional: 0, independent unconditional: 5598, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13832, independent: 13163, independent conditional: 7565, independent unconditional: 5598, dependent: 669, dependent conditional: 665, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 7565, independent unconditional: 5598, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 7565, independent unconditional: 5598, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 0, independent unconditional: 13163, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 0, independent unconditional: 13163, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13167, independent: 13163, independent conditional: 0, independent unconditional: 13163, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5340, independent: 5336, independent conditional: 0, independent unconditional: 5336, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5340, independent: 5335, independent conditional: 0, independent unconditional: 5335, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13167, independent: 7827, independent conditional: 0, independent unconditional: 7827, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5340, unknown conditional: 0, unknown unconditional: 5340] , Statistics on independence cache: Total cache size (in pairs): 5340, Positive cache size: 5336, Positive conditional cache size: 0, Positive unconditional cache size: 5336, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 665 - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 206 known predicates. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 206 known predicates. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 206 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 396 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 553.7s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 340.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 416, 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.3s SsaConstructionTime, 18.0s SatisfiabilityAnalysisTime, 192.5s InterpolantComputationTime, 5005 NumberOfCodeBlocks, 4972 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 7242 ConstructedInterpolants, 76 QuantifiedInterpolants, 107745 SizeOfPredicates, 275 NumberOfNonLiveVariables, 4300 ConjunctsInSsa, 519 ConjunctsInUnsatCore, 27 InterpolantComputations, 2 PerfectInterpolantSequences, 2907/11547 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown