/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-04 21:18:51,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 21:18:51,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 21:18:51,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 21:18:51,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 21:18:51,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 21:18:51,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 21:18:51,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 21:18:51,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 21:18:51,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 21:18:51,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 21:18:51,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 21:18:51,955 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 21:18:51,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 21:18:51,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 21:18:51,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 21:18:51,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 21:18:51,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 21:18:51,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 21:18:51,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 21:18:51,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 21:18:51,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 21:18:51,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 21:18:51,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 21:18:51,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 21:18:51,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 21:18:51,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 21:18:51,960 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 21:18:51,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 21:18:51,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 21:18:51,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 21:18:51,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 21:18:51,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 21:18:51,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 21:18:51,962 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 21:18:51,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 21:18:51,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 21:18:51,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 21:18:51,963 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 21:18:51,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> NONE [2024-05-04 21:18:52,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 21:18:52,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 21:18:52,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 21:18:52,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-04 21:18:52,222 INFO L274 PluginConnector]: CDTParser initialized [2024-05-04 21:18:52,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-05-04 21:18:53,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-04 21:18:53,379 INFO L384 CDTParser]: Found 1 translation units. [2024-05-04 21:18:53,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-05-04 21:18:53,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e6a539696/b12e1ec2c1ac421782cf4f7a59492dc1/FLAGdae12d525 [2024-05-04 21:18:53,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e6a539696/b12e1ec2c1ac421782cf4f7a59492dc1 [2024-05-04 21:18:53,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 21:18:53,403 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-04 21:18:53,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-04 21:18:53,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-04 21:18:53,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-04 21:18:53,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a0b4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53, skipping insertion in model container [2024-05-04 21:18:53,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,436 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-04 21:18:53,551 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-4.wvr.c[2808,2821] [2024-05-04 21:18:53,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 21:18:53,563 INFO L202 MainTranslator]: Completed pre-run [2024-05-04 21:18:53,578 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-4.wvr.c[2808,2821] [2024-05-04 21:18:53,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 21:18:53,590 INFO L206 MainTranslator]: Completed translation [2024-05-04 21:18:53,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53 WrapperNode [2024-05-04 21:18:53,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-04 21:18:53,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 21:18:53,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 21:18:53,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 21:18:53,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,637 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 186 [2024-05-04 21:18:53,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 21:18:53,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 21:18:53,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 21:18:53,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 21:18:53,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 21:18:53,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 21:18:53,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 21:18:53,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 21:18:53,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (1/1) ... [2024-05-04 21:18:53,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 21:18:53,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:18:53,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-04 21:18:53,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-04 21:18:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-04 21:18:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-04 21:18:53,776 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-04 21:18:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-04 21:18:53,776 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-04 21:18:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-04 21:18:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-04 21:18:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-04 21:18:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-04 21:18:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 21:18:53,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 21:18:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-04 21:18:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-04 21:18:53,780 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 21:18:53,866 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 21:18:53,868 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 21:18:54,084 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 21:18:54,094 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 21:18:54,094 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-04 21:18:54,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 09:18:54 BoogieIcfgContainer [2024-05-04 21:18:54,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 21:18:54,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 21:18:54,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 21:18:54,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 21:18:54,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 09:18:53" (1/3) ... [2024-05-04 21:18:54,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 09:18:54, skipping insertion in model container [2024-05-04 21:18:54,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:18:53" (2/3) ... [2024-05-04 21:18:54,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 09:18:54, skipping insertion in model container [2024-05-04 21:18:54,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 09:18:54" (3/3) ... [2024-05-04 21:18:54,101 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-05-04 21:18:54,107 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 21:18:54,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 21:18:54,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 21:18:54,114 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 21:18:54,182 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-04 21:18:54,213 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 21:18:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 21:18:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:18:54,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-04 21:18:54,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-04 21:18:54,242 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 21:18:54,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 21:18:54,253 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;@4f55e668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-04 21:18:54,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-04 21:18:54,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-04 21:18:54,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:18:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash -124361033, now seen corresponding path program 1 times [2024-05-04 21:18:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:18:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438140838] [2024-05-04 21:18:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:18:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:18:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:18:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 21:18:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:18:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438140838] [2024-05-04 21:18:54,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438140838] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:18:54,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:18:54,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-04 21:18:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103600360] [2024-05-04 21:18:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:18:54,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-04 21:18:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:18:54,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-04 21:18:54,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-04 21:18:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:54,690 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:18:54,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 21:18:54,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:54,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-04 21:18:54,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-04 21:18:54,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:18:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2010415305, now seen corresponding path program 1 times [2024-05-04 21:18:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:18:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458370590] [2024-05-04 21:18:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:18:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:18:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:18:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:18:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:18:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458370590] [2024-05-04 21:18:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458370590] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:18:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735072265] [2024-05-04 21:18:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:18:55,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:18:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:18:55,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:18:55,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-04 21:18:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:18:55,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-04 21:18:55,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:18:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:18:55,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-04 21:18:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735072265] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:18:55,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-04 21:18:55,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-05-04 21:18:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805537736] [2024-05-04 21:18:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:18:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-04 21:18:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:18:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-04 21:18:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-05-04 21:18:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:55,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:18:55,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 21:18:55,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:55,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 21:18:56,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-04 21:18:56,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-05-04 21:18:56,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-04 21:18:56,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:18:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1699666781, now seen corresponding path program 1 times [2024-05-04 21:18:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:18:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511867135] [2024-05-04 21:18:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:18:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:18:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:18:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 21:18:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:18:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511867135] [2024-05-04 21:18:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511867135] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:18:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774273766] [2024-05-04 21:18:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:18:56,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:18:56,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:18:56,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:18:56,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-04 21:18:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:18:56,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjunts are in the unsatisfiable core [2024-05-04 21:18:56,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:18:57,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-04 21:18:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:18:57,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:18:57,914 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-04 21:18:57,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-04 21:18:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:18:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774273766] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 21:18:58,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 21:18:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2024-05-04 21:18:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530471141] [2024-05-04 21:18:58,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 21:18:58,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-04 21:18:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:18:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-04 21:18:58,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2024-05-04 21:18:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:58,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:18:58,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.439024390243903) internal successors, (387), 41 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 21:18:58,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:18:58,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 21:18:58,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 21:19:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-04 21:19:00,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-04 21:19:00,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:19:00,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-04 21:19:00,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:19:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1110464735, now seen corresponding path program 1 times [2024-05-04 21:19:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:19:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679223263] [2024-05-04 21:19:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:19:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:19:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:19:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-04 21:19:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:19:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679223263] [2024-05-04 21:19:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679223263] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:19:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428575928] [2024-05-04 21:19:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:19:01,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:19:01,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:19:01,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:19:01,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-04 21:19:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:19:01,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-04 21:19:01,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:19:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-04 21:19:02,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:19:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-04 21:19:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428575928] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 21:19:03,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 21:19:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 36 [2024-05-04 21:19:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714340287] [2024-05-04 21:19:03,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 21:19:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-04 21:19:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:19:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-04 21:19:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2024-05-04 21:19:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:03,553 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:19:03,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.416666666666666) internal successors, (447), 36 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 21:19:03,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:03,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 21:19:03,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-04 21:19:03,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 21:19:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-04 21:19:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-04 21:19:07,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-04 21:19:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:19:08,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-04 21:19:08,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:19:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1013286976, now seen corresponding path program 2 times [2024-05-04 21:19:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:19:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490527288] [2024-05-04 21:19:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:19:08,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:19:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:19:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-04 21:19:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:19:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490527288] [2024-05-04 21:19:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490527288] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:19:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128646806] [2024-05-04 21:19:10,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 21:19:10,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:19:10,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:19:10,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:19:10,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-04 21:19:10,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 21:19:10,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 21:19:10,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-04 21:19:10,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:19:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-04 21:19:11,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:19:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-04 21:19:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128646806] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 21:19:15,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 21:19:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 101 [2024-05-04 21:19:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122044255] [2024-05-04 21:19:15,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 21:19:15,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-05-04 21:19:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:19:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-05-04 21:19:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=9303, Unknown=0, NotChecked=0, Total=10100 [2024-05-04 21:19:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:15,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:19:15,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 7.03960396039604) internal successors, (711), 101 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 21:19:15,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:15,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 21:19:15,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-04 21:19:15,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-04 21:19:15,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:19:26,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse5 19) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse6) (< .cse2 .cse7) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse7) (< .cse3 .cse7) (< .cse3 .cse6) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< .cse5 .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6))) is different from false [2024-05-04 21:19:31,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:19:34,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:19:45,684 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse2 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse4 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 18) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse2 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 .cse3) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse1 .cse3) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 6) 4294967296) 1)) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 10) 4294967296) 1)))) is different from false [2024-05-04 21:20:10,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:21:43,571 WARN L293 SmtUtils]: Spent 11.28s on a formula simplification. DAG size of input: 64 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 21:21:44,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:21:46,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:22:51,997 WARN L293 SmtUtils]: Spent 11.64s on a formula simplification. DAG size of input: 60 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 21:22:54,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:22:57,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:22:59,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:23:25,522 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 55 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 21:24:04,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:24:19,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:24:41,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-05-04 21:27:31,733 WARN L293 SmtUtils]: Spent 36.52s on a formula simplification. DAG size of input: 90 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 21:27:33,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:27:35,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:27:37,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:27:39,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:27:41,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse3 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse1 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse1 .cse2) (< .cse3 .cse4) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse4) (< .cse0 .cse2) (< .cse3 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)))) is different from false [2024-05-04 21:31:46,182 WARN L293 SmtUtils]: Spent 54.48s on a formula simplification. DAG size of input: 98 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 21:31:48,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:31:50,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:31:52,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:31:54,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse4) (< .cse2 .cse5) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse3 .cse5) (< .cse3 .cse4) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)))) is different from false [2024-05-04 21:32:18,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse3 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse2 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 18) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse4) (< .cse0 .cse5) (< .cse3 .cse6) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse6) (< .cse1 .cse5) (< .cse1 .cse4) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 6) 4294967296) 1)) (< .cse0 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 10) 4294967296) 1)))) is different from false [2024-05-04 21:32:28,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:30,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:31,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:33,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:35,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:37,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:39,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:41,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:32:43,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:14,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:15,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:17,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:19,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:21,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:23,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:27,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:29,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-05-04 21:33:30,714 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 21:33:30,714 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 21:33:30,714 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 21:33:31,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 21:33:31,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-04 21:33:31,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-04 21:33:31,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-04 21:33:31,828 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-04 21:33:31,829 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-04 21:33:31,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-04 21:33:31,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-04 21:33:31,839 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-05-04 21:33:31,841 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 21:33:31,841 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 21:33:31,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 09:33:31 BasicIcfg [2024-05-04 21:33:31,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 21:33:31,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2024-05-04 21:33:31,846 INFO L158 Benchmark]: Toolchain (without parser) took 878442.89ms. Allocated memory was 151.0MB in the beginning and 539.0MB in the end (delta: 388.0MB). Free memory was 87.7MB in the beginning and 391.7MB in the end (delta: -304.0MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2024-05-04 21:33:31,846 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 151.0MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 21:33:31,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.83ms. Allocated memory is still 151.0MB. Free memory was 87.5MB in the beginning and 75.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-04 21:33:31,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.98ms. Allocated memory is still 151.0MB. Free memory was 75.3MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-04 21:33:31,847 INFO L158 Benchmark]: Boogie Preprocessor took 19.76ms. Allocated memory is still 151.0MB. Free memory was 73.2MB in the beginning and 71.3MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 21:33:31,847 INFO L158 Benchmark]: RCFGBuilder took 436.84ms. Allocated memory is still 151.0MB. Free memory was 71.3MB in the beginning and 109.3MB in the end (delta: -38.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2024-05-04 21:33:31,848 INFO L158 Benchmark]: TraceAbstraction took 877748.51ms. Allocated memory was 151.0MB in the beginning and 539.0MB in the end (delta: 388.0MB). Free memory was 108.3MB in the beginning and 391.7MB in the end (delta: -283.4MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. [2024-05-04 21:33:31,849 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.09ms. Allocated memory is still 151.0MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.83ms. Allocated memory is still 151.0MB. Free memory was 87.5MB in the beginning and 75.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.98ms. Allocated memory is still 151.0MB. Free memory was 75.3MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.76ms. Allocated memory is still 151.0MB. Free memory was 73.2MB in the beginning and 71.3MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 436.84ms. Allocated memory is still 151.0MB. Free memory was 71.3MB in the beginning and 109.3MB in the end (delta: -38.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 877748.51ms. Allocated memory was 151.0MB in the beginning and 539.0MB in the end (delta: 388.0MB). Free memory was 108.3MB in the beginning and 391.7MB in the end (delta: -283.4MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12944, independent: 10630, independent conditional: 10630, independent unconditional: 0, dependent: 2314, dependent conditional: 2314, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 10630, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 10630, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 10630, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 0, independent unconditional: 10630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 0, independent unconditional: 10630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 0, independent unconditional: 10630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1646, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1646, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10630, independent: 8984, independent conditional: 0, independent unconditional: 8984, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1646, unknown conditional: 0, unknown unconditional: 1646] , Statistics on independence cache: Total cache size (in pairs): 1646, Positive cache size: 1646, Positive conditional cache size: 0, Positive unconditional cache size: 1646, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 0, independent unconditional: 10630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 0, independent unconditional: 10630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10630, independent: 10630, independent conditional: 0, independent unconditional: 10630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1646, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1646, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10630, independent: 8984, independent conditional: 0, independent unconditional: 8984, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1646, unknown conditional: 0, unknown unconditional: 1646] , Statistics on independence cache: Total cache size (in pairs): 1646, Positive cache size: 1646, Positive conditional cache size: 0, Positive unconditional cache size: 1646, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0 ], Independence queries for same thread: 2314 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 338 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 877.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 862.7s, 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: 361, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2699 ConstructedInterpolants, 34 QuantifiedInterpolants, 25233 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1623 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 63/1257 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown