/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 18:20:41,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 18:20:41,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 18:20:41,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 18:20:41,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 18:20:41,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 18:20:41,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 18:20:41,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 18:20:41,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 18:20:41,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 18:20:41,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 18:20:41,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 18:20:41,181 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 18:20:41,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 18:20:41,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 18:20:41,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 18:20:41,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 18:20:41,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 18:20:41,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 18:20:41,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 18:20:41,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 18:20:41,185 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 18:20:41,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 18:20:41,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 18:20:41,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 18:20:41,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 18:20:41,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 18:20:41,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 18:20:41,187 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 18:20:41,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 18:20:41,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 18:20:41,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 18:20:41,188 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 18:20:41,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-05-05 18:20:41,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 18:20:41,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 18:20:41,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 18:20:41,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 18:20:41,400 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 18:20:41,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-05-05 18:20:42,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 18:20:42,687 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 18:20:42,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-05-05 18:20:42,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9cb5e954d/bd0a6a347fe1429bb68ed0e46f5aff87/FLAG4fe275513 [2024-05-05 18:20:42,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9cb5e954d/bd0a6a347fe1429bb68ed0e46f5aff87 [2024-05-05 18:20:42,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 18:20:42,707 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 18:20:42,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 18:20:42,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 18:20:42,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 18:20:42,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:42,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0cd718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42, skipping insertion in model container [2024-05-05 18:20:42,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:42,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 18:20:42,911 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/popl20-mult-4.wvr.c[2612,2625] [2024-05-05 18:20:42,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 18:20:42,927 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 18:20:42,958 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/popl20-mult-4.wvr.c[2612,2625] [2024-05-05 18:20:42,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 18:20:42,972 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 18:20:42,972 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 18:20:42,977 INFO L206 MainTranslator]: Completed translation [2024-05-05 18:20:42,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42 WrapperNode [2024-05-05 18:20:42,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 18:20:42,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 18:20:42,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 18:20:42,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 18:20:42,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:42,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,024 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-05-05 18:20:43,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 18:20:43,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 18:20:43,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 18:20:43,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 18:20:43,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 18:20:43,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 18:20:43,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 18:20:43,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 18:20:43,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (1/1) ... [2024-05-05 18:20:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 18:20:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:20:43,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-05 18:20:43,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-05 18:20:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 18:20:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-05 18:20:43,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-05 18:20:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-05 18:20:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-05 18:20:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-05 18:20:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-05 18:20:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-05 18:20:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-05 18:20:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 18:20:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 18:20:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 18:20:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 18:20:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 18:20:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 18:20:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 18:20:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 18:20:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 18:20:43,147 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 18:20:43,253 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 18:20:43,254 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 18:20:43,459 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 18:20:43,491 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 18:20:43,491 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-05 18:20:43,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 06:20:43 BoogieIcfgContainer [2024-05-05 18:20:43,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 18:20:43,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 18:20:43,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 18:20:43,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 18:20:43,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 06:20:42" (1/3) ... [2024-05-05 18:20:43,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3388d1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 06:20:43, skipping insertion in model container [2024-05-05 18:20:43,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:20:42" (2/3) ... [2024-05-05 18:20:43,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3388d1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 06:20:43, skipping insertion in model container [2024-05-05 18:20:43,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 06:20:43" (3/3) ... [2024-05-05 18:20:43,506 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-05-05 18:20:43,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 18:20:43,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 18:20:43,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 18:20:43,523 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 18:20:43,606 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-05 18:20:43,653 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 18:20:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 18:20:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:20:43,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-05 18:20:43,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-05 18:20:43,684 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 18:20:43,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:20:43,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 18:20:43,707 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;@82a3077, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-05 18:20:43,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-05 18:20:45,233 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 18:20:45,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:20:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 825825901, now seen corresponding path program 1 times [2024-05-05 18:20:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:20:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37213596] [2024-05-05 18:20:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-05-05 18:20:45,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:20:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37213596] [2024-05-05 18:20:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37213596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 18:20:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 18:20:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 18:20:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792479212] [2024-05-05 18:20:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 18:20:45,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 18:20:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:20:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 18:20:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 18:20:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:20:45,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:20:45,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 18:20:45,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:20:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:20:46,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 18:20:46,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 18:20:46,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:20:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1856459753, now seen corresponding path program 1 times [2024-05-05 18:20:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:20:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873950172] [2024-05-05 18:20:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 173 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-05 18:20:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:20:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873950172] [2024-05-05 18:20:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873950172] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 18:20:48,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103746182] [2024-05-05 18:20:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:48,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:20:48,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:20:48,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 18:20:48,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-05 18:20:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:48,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-05 18:20:48,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 18:20:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-05 18:20:49,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 18:20:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-05 18:20:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103746182] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 18:20:50,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 18:20:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 51 [2024-05-05 18:20:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34169697] [2024-05-05 18:20:50,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 18:20:50,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-05 18:20:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:20:50,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1851303999, now seen corresponding path program 1 times [2024-05-05 18:20:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:50,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 18:20:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 986693666, now seen corresponding path program 2 times [2024-05-05 18:20:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:50,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 18:20:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:50,599 INFO L85 PathProgramCache]: Analyzing trace with hash -540021526, now seen corresponding path program 1 times [2024-05-05 18:20:50,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:50,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:20:51,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:20:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 439202260, now seen corresponding path program 2 times [2024-05-05 18:20:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:51,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 18:20:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 279327084, now seen corresponding path program 3 times [2024-05-05 18:20:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-05 18:20:52,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-05 18:20:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -258722764, now seen corresponding path program 4 times [2024-05-05 18:20:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:20:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:20:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash 569529268, now seen corresponding path program 5 times [2024-05-05 18:20:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:20:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:20:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash 475538487, now seen corresponding path program 6 times [2024-05-05 18:20:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:54,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 18:20:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash 794340347, now seen corresponding path program 7 times [2024-05-05 18:20:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:54,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 18:20:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 18:20:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1143093698, now seen corresponding path program 8 times [2024-05-05 18:20:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1143093698, now seen corresponding path program 9 times [2024-05-05 18:20:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 998595968, now seen corresponding path program 10 times [2024-05-05 18:20:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:55,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 891704314, now seen corresponding path program 11 times [2024-05-05 18:20:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1105615244, now seen corresponding path program 12 times [2024-05-05 18:20:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:56,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1238854576, now seen corresponding path program 13 times [2024-05-05 18:20:57,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 833318771, now seen corresponding path program 14 times [2024-05-05 18:20:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 63078477, now seen corresponding path program 15 times [2024-05-05 18:20:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1955433141, now seen corresponding path program 16 times [2024-05-05 18:20:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash 488885583, now seen corresponding path program 17 times [2024-05-05 18:20:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:59,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:20:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:20:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2024415753, now seen corresponding path program 18 times [2024-05-05 18:20:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:20:59,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:20:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:21:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:21:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:21:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:21:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:21:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 18:21:00,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-05-05 18:21:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3583, Unknown=0, NotChecked=0, Total=3782 [2024-05-05 18:21:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:21:00,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:21:00,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 8.425925925925926) internal successors, (455), 54 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 18:21:00,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:21:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:21:18,777 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-05 18:21:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:21:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2024-05-05 18:21:43,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-05 18:21:43,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-05 18:21:43,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 18:21:43,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:21:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash -768410976, now seen corresponding path program 2 times [2024-05-05 18:21:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:21:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634076575] [2024-05-05 18:21:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:21:43,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:21:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:21:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 135 proven. 738 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-05-05 18:21:44,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:21:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634076575] [2024-05-05 18:21:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634076575] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 18:21:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120480833] [2024-05-05 18:21:44,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 18:21:44,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:21:44,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:21:44,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 18:21:44,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-05 18:21:45,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 18:21:45,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 18:21:45,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 37 conjunts are in the unsatisfiable core [2024-05-05 18:21:45,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 18:21:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 503 proven. 8 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-05-05 18:21:45,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 18:21:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 503 proven. 8 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-05-05 18:21:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120480833] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 18:21:45,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 18:21:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 4, 4] total 25 [2024-05-05 18:21:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107682752] [2024-05-05 18:21:45,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 18:21:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-05 18:21:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:21:45,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-05 18:21:45,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2024-05-05 18:21:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:21:45,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:21:45,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.44) internal successors, (361), 25 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 18:21:45,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:21:45,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2024-05-05 18:21:45,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:22:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:22:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2024-05-05 18:22:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-05-05 18:22:00,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-05 18:22:00,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-05-05 18:22:00,926 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 18:22:00,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:22:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash -579706167, now seen corresponding path program 3 times [2024-05-05 18:22:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:22:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296406089] [2024-05-05 18:22:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:22:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:22:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:22:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 220 proven. 253 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-05-05 18:22:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:22:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296406089] [2024-05-05 18:22:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296406089] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 18:22:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421456155] [2024-05-05 18:22:01,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 18:22:01,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:22:01,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:22:01,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 18:22:01,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-05 18:22:07,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-05 18:22:07,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 18:22:07,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 70 conjunts are in the unsatisfiable core [2024-05-05 18:22:07,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 18:22:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 99 proven. 521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-05 18:22:09,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 18:22:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 99 proven. 521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-05 18:22:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421456155] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 18:22:11,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 18:22:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 37, 37] total 87 [2024-05-05 18:22:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871580480] [2024-05-05 18:22:11,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 18:22:11,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-05-05 18:22:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:22:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-05-05 18:22:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=6999, Unknown=0, NotChecked=0, Total=7482 [2024-05-05 18:22:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:22:11,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:22:11,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 6.137931034482759) internal successors, (534), 87 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 18:22:11,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:22:11,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 267 states. [2024-05-05 18:22:11,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-05-05 18:22:11,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:22:30,452 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 80 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:22:42,691 WARN L293 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 94 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:22:49,799 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 68 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:23:14,525 WARN L293 SmtUtils]: Spent 19.92s on a formula simplification. DAG size of input: 85 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:23:42,675 WARN L293 SmtUtils]: Spent 22.93s on a formula simplification. DAG size of input: 97 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:23:43,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:24:09,799 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 85 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:24:13,822 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-05 18:24:44,517 WARN L293 SmtUtils]: Spent 20.86s on a formula simplification. DAG size of input: 97 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:24:45,679 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-05 18:24:48,141 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-05 18:24:59,049 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 55 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:25:01,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:03,714 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-05 18:25:07,836 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-05 18:25:18,689 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 67 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:25:21,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:23,494 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-05 18:25:26,256 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-05 18:25:28,268 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-05 18:25:32,239 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-05 18:25:34,245 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-05 18:25:36,521 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-05 18:25:37,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:40,680 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-05 18:25:42,870 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-05 18:25:44,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:46,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:47,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:50,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:25:53,763 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-05 18:27:27,838 WARN L293 SmtUtils]: Spent 24.70s on a formula simplification. DAG size of input: 76 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:27:31,181 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-05 18:27:33,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:27:44,980 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 69 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:27:47,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:27:50,185 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-05 18:27:52,927 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-05 18:27:54,931 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-05 18:27:56,992 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-05 18:27:59,177 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-05 18:28:01,184 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-05 18:28:03,414 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-05 18:28:07,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:28:09,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ 7 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse3 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse7 (+ (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296)) (.cse2 (+ (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse0 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (.cse1 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse11 (+ (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse12 (+ (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296) 1)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (.cse9 (+ (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1))) (and (<= (+ c_thread1Thread1of1ForFork2_~i~0 (* 4294967296 (div c_~N~0 4294967296)) 1) (+ c_~N~0 .cse0)) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread1Thread1of1ForFork2_~i~0) (< .cse1 .cse2) (< .cse3 .cse4) (< (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) .cse4) (= |c_thread2Thread1of1ForFork0_~i~1#1| |c_thread1Thread1of1ForFork2_#t~post1|) (< .cse5 (+ (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296) 1)) (< .cse6 .cse7) (< .cse8 .cse9) (< .cse10 .cse11) (< .cse3 .cse7) (< .cse5 (+ (mod c_thread3Thread1of1ForFork1_~i~2 4294967296) 1)) (< .cse6 .cse2) (<= .cse0 c_thread1Thread1of1ForFork2_~i~0) (< (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod c_~N~0 4294967296)) (< .cse1 .cse12) (< .cse8 .cse11) (< .cse10 .cse12) (< .cse5 .cse9))) is different from false [2024-05-05 18:28:19,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:28:21,998 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-05 18:28:25,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:28:27,719 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-05 18:28:31,955 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-05 18:28:33,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:28:35,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:28:37,599 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-05 18:28:39,603 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-05 18:28:41,836 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-05 18:28:43,839 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-05 18:28:47,814 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-05 18:28:49,988 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-05 18:28:53,269 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 [] [2024-05-05 18:28:55,280 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-05 18:28:57,291 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-05 18:28:58,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:00,833 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-05 18:29:02,296 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-05 18:29:04,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:08,591 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-05 18:29:10,603 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-05 18:29:12,610 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-05 18:29:14,614 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-05 18:29:17,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1))) (let ((.cse3 (+ (mod (+ 7 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse6 (+ (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296)) (.cse1 (+ (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse10 (+ (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse11 (+ (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296) 1)) (.cse4 (mod .cse12 4294967296)) (.cse8 (+ (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 .cse3) (< (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) .cse3) (= |c_thread2Thread1of1ForFork0_~i~1#1| |c_thread1Thread1of1ForFork2_#t~post1|) (< .cse4 (+ (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296) 1)) (< .cse5 .cse6) (< .cse7 .cse8) (< .cse9 .cse10) (< .cse2 .cse6) (< .cse4 (+ (mod c_thread3Thread1of1ForFork1_~i~2 4294967296) 1)) (< .cse5 .cse1) (< (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod c_~N~0 4294967296)) (< .cse0 .cse11) (= .cse12 c_thread1Thread1of1ForFork2_~i~0) (< .cse7 .cse10) (< .cse9 .cse11) (< .cse4 .cse8)))) is different from false [2024-05-05 18:29:27,716 WARN L293 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 59 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:29:31,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:33,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:35,476 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-05 18:29:38,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:40,750 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-05 18:31:23,757 WARN L293 SmtUtils]: Spent 26.95s on a formula simplification. DAG size of input: 68 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:31:35,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:31:48,453 WARN L293 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 80 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:31:51,477 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-05 18:31:52,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:31:54,991 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-05 18:31:58,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:32:00,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:32:03,372 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-05 18:32:05,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:32:07,444 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-05 18:32:09,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:32:11,619 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-05 18:32:14,503 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-05 18:32:16,508 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-05 18:32:17,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:32:20,069 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-05 18:32:22,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:33:56,875 WARN L293 SmtUtils]: Spent 33.74s on a formula simplification. DAG size of input: 89 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:33:59,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:34:12,795 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-05 18:34:14,839 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-05 18:34:16,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:34:19,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:34:21,139 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-05 18:34:28,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:34:35,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:34:37,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:34:39,434 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-05 18:34:51,066 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-05 18:35:02,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:35:04,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-05-05 18:35:05,219 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-05 18:35:05,220 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-05 18:35:05,219 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-05 18:35:05,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-05 18:35:05,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-05-05 18:35:05,566 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 234 known predicates. [2024-05-05 18:35:05,568 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-05 18:35:05,568 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-05 18:35:05,568 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-05 18:35:05,568 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-05 18:35:05,568 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-05 18:35:05,572 INFO L448 BasicCegarLoop]: Path program histogram: [18, 3, 2, 1] [2024-05-05 18:35:05,574 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 18:35:05,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 18:35:05,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 06:35:05 BasicIcfg [2024-05-05 18:35:05,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 18:35:05,576 INFO L158 Benchmark]: Toolchain (without parser) took 862868.62ms. Allocated memory was 177.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 104.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 232.6MB. Max. memory is 8.0GB. [2024-05-05 18:35:05,576 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 18:35:05,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.00ms. Allocated memory was 177.2MB in the beginning and 268.4MB in the end (delta: 91.2MB). Free memory was 104.6MB in the beginning and 236.7MB in the end (delta: -132.1MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2024-05-05 18:35:05,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 268.4MB. Free memory was 236.7MB in the beginning and 234.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 18:35:05,576 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 268.4MB. Free memory was 234.6MB in the beginning and 233.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-05 18:35:05,576 INFO L158 Benchmark]: RCFGBuilder took 436.17ms. Allocated memory is still 268.4MB. Free memory was 233.0MB in the beginning and 213.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-05-05 18:35:05,577 INFO L158 Benchmark]: TraceAbstraction took 862080.65ms. Allocated memory was 268.4MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 212.4MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 247.7MB. Max. memory is 8.0GB. [2024-05-05 18:35:05,578 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 139.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.00ms. Allocated memory was 177.2MB in the beginning and 268.4MB in the end (delta: 91.2MB). Free memory was 104.6MB in the beginning and 236.7MB in the end (delta: -132.1MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 268.4MB. Free memory was 236.7MB in the beginning and 234.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 268.4MB. Free memory was 234.6MB in the beginning and 233.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 436.17ms. Allocated memory is still 268.4MB. Free memory was 233.0MB in the beginning and 213.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 862080.65ms. Allocated memory was 268.4MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 212.4MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 247.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1469879, independent: 1369099, independent conditional: 1369097, independent unconditional: 2, dependent: 100780, dependent conditional: 100780, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1372338, independent: 1369099, independent conditional: 1369097, independent unconditional: 2, dependent: 3239, dependent conditional: 3239, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1372338, independent: 1369099, independent conditional: 1369097, independent unconditional: 2, dependent: 3239, dependent conditional: 3239, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1372338, independent: 1369099, independent conditional: 1369097, independent unconditional: 2, dependent: 3239, dependent conditional: 3239, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1382812, independent: 1369099, independent conditional: 12357, independent unconditional: 1356742, dependent: 13713, dependent conditional: 4798, dependent unconditional: 8915, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1382812, independent: 1369099, independent conditional: 11804, independent unconditional: 1357295, dependent: 13713, dependent conditional: 1658, dependent unconditional: 12055, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1382812, independent: 1369099, independent conditional: 11804, independent unconditional: 1357295, dependent: 13713, dependent conditional: 1658, dependent unconditional: 12055, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2116, independent: 2001, independent conditional: 310, independent unconditional: 1691, dependent: 115, dependent conditional: 107, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2116, independent: 1805, independent conditional: 0, independent unconditional: 1805, dependent: 311, dependent conditional: 0, dependent unconditional: 311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 311, independent: 196, independent conditional: 192, independent unconditional: 4, dependent: 115, dependent conditional: 107, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 311, independent: 196, independent conditional: 192, independent unconditional: 4, dependent: 115, dependent conditional: 107, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1053, independent: 738, independent conditional: 719, independent unconditional: 18, dependent: 315, dependent conditional: 254, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1382812, independent: 1367098, independent conditional: 11494, independent unconditional: 1355604, dependent: 13598, dependent conditional: 1551, dependent unconditional: 12047, unknown: 2116, unknown conditional: 417, unknown unconditional: 1699] , Statistics on independence cache: Total cache size (in pairs): 2116, Positive cache size: 2001, Positive conditional cache size: 310, Positive unconditional cache size: 1691, Negative cache size: 115, Negative conditional cache size: 107, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3693, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1382812, independent: 1369099, independent conditional: 12357, independent unconditional: 1356742, dependent: 13713, dependent conditional: 4798, dependent unconditional: 8915, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1382812, independent: 1369099, independent conditional: 11804, independent unconditional: 1357295, dependent: 13713, dependent conditional: 1658, dependent unconditional: 12055, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1382812, independent: 1369099, independent conditional: 11804, independent unconditional: 1357295, dependent: 13713, dependent conditional: 1658, dependent unconditional: 12055, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2116, independent: 2001, independent conditional: 310, independent unconditional: 1691, dependent: 115, dependent conditional: 107, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2116, independent: 1805, independent conditional: 0, independent unconditional: 1805, dependent: 311, dependent conditional: 0, dependent unconditional: 311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 311, independent: 196, independent conditional: 192, independent unconditional: 4, dependent: 115, dependent conditional: 107, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 311, independent: 196, independent conditional: 192, independent unconditional: 4, dependent: 115, dependent conditional: 107, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1053, independent: 738, independent conditional: 719, independent unconditional: 18, dependent: 315, dependent conditional: 254, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1382812, independent: 1367098, independent conditional: 11494, independent unconditional: 1355604, dependent: 13598, dependent conditional: 1551, dependent unconditional: 12047, unknown: 2116, unknown conditional: 417, unknown unconditional: 1699] , Statistics on independence cache: Total cache size (in pairs): 2116, Positive cache size: 2001, Positive conditional cache size: 310, Positive unconditional cache size: 1691, Negative cache size: 115, Negative conditional cache size: 107, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3693 ], Independence queries for same thread: 97541 - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 234 known predicates. - TimeoutResultAtElement [Line: 92]: 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 234 known predicates. - TimeoutResultAtElement [Line: 94]: 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 234 known predicates. - TimeoutResultAtElement [Line: 91]: 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 234 known predicates. - TimeoutResultAtElement [Line: 93]: 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 234 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 861.9s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 18, EmptinessCheckTime: 834.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 516, 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, 6.7s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1712 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2452 ConstructedInterpolants, 0 QuantifiedInterpolants, 12460 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1544 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 3872/6472 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: 10.3s, ConditionalCommutativityIAIntegrations: 1, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 20, ConditionalCommutativityTraceChecks: 20, ConditionalCommutativityImperfectProofs: 14 RESULT: Ultimate could not prove your program: Timeout [2024-05-05 18:35:05,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Completed graceful shutdown