/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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 00:13:23,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 00:13:23,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 00:13:23,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 00:13:23,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 00:13:23,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 00:13:23,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 00:13:23,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 00:13:23,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 00:13:23,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 00:13:23,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 00:13:23,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 00:13:23,353 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 00:13:23,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 00:13:23,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 00:13:23,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 00:13:23,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 00:13:23,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 00:13:23,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 00:13:23,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 00:13:23,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 00:13:23,356 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 00:13:23,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 00:13:23,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 00:13:23,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 00:13:23,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 00:13:23,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 00:13:23,359 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 -> DFS 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-06 00:13:23,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 00:13:23,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 00:13:23,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 00:13:23,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-06 00:13:23,658 INFO L274 PluginConnector]: CDTParser initialized [2024-04-06 00:13:23,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-04-06 00:13:24,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-06 00:13:24,839 INFO L384 CDTParser]: Found 1 translation units. [2024-04-06 00:13:24,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-04-06 00:13:24,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/916f0e095/efcd18910cc94a17b3c2e8a711d5e64e/FLAGf59509f82 [2024-04-06 00:13:24,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/916f0e095/efcd18910cc94a17b3c2e8a711d5e64e [2024-04-06 00:13:24,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 00:13:24,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-06 00:13:24,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-06 00:13:24,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-06 00:13:24,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-06 00:13:24,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 12:13:24" (1/1) ... [2024-04-06 00:13:24,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149aeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:24, skipping insertion in model container [2024-04-06 00:13:24,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 12:13:24" (1/1) ... [2024-04-06 00:13:24,898 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-06 00:13:25,047 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/test-hard1.wvr.c[3373,3386] [2024-04-06 00:13:25,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 00:13:25,062 INFO L202 MainTranslator]: Completed pre-run [2024-04-06 00:13:25,097 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/test-hard1.wvr.c[3373,3386] [2024-04-06 00:13:25,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 00:13:25,105 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 00:13:25,105 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 00:13:25,110 INFO L206 MainTranslator]: Completed translation [2024-04-06 00:13:25,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25 WrapperNode [2024-04-06 00:13:25,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-06 00:13:25,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 00:13:25,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 00:13:25,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 00:13:25,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,155 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-04-06 00:13:25,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 00:13:25,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 00:13:25,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 00:13:25,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 00:13:25,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 00:13:25,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 00:13:25,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 00:13:25,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 00:13:25,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (1/1) ... [2024-04-06 00:13:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 00:13:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:13:25,266 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-04-06 00:13:25,269 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-04-06 00:13:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-06 00:13:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 00:13:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 00:13:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 00:13:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 00:13:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 00:13:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 00:13:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 00:13:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-06 00:13:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-06 00:13:25,309 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 00:13:25,373 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 00:13:25,374 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 00:13:25,556 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 00:13:25,637 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 00:13:25,637 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-04-06 00:13:25,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:13:25 BoogieIcfgContainer [2024-04-06 00:13:25,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 00:13:25,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 00:13:25,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 00:13:25,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 00:13:25,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 12:13:24" (1/3) ... [2024-04-06 00:13:25,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8f3696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 12:13:25, skipping insertion in model container [2024-04-06 00:13:25,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:13:25" (2/3) ... [2024-04-06 00:13:25,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8f3696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 12:13:25, skipping insertion in model container [2024-04-06 00:13:25,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:13:25" (3/3) ... [2024-04-06 00:13:25,646 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-04-06 00:13:25,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 00:13:25,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 00:13:25,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 00:13:25,664 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 00:13:25,747 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-06 00:13:25,808 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 00:13:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 00:13:25,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:13:25,813 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-04-06 00:13:25,817 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-04-06 00:13:25,858 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 00:13:25,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:13:25,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 00:13:25,891 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;@44ac12fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213 [2024-04-06 00:13:25,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-06 00:13:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash 738820654, now seen corresponding path program 1 times [2024-04-06 00:13:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-06 00:13:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-06 00:13:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-06 00:13:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-06 00:13:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1506728072, now seen corresponding path program 1 times [2024-04-06 00:13:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:27,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221441, now seen corresponding path program 2 times [2024-04-06 00:13:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:28,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1490250254, now seen corresponding path program 3 times [2024-04-06 00:13:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:28,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:29,098 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-04-06 00:13:29,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:13:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-04-06 00:13:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:13:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269606782] [2024-04-06 00:13:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-04-06 00:13:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:13:29,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269606782] [2024-04-06 00:13:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269606782] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:13:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:13:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-06 00:13:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275088601] [2024-04-06 00:13:29,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:13:29,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-06 00:13:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:13:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-06 00:13:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-06 00:13:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:13:29,495 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:13:29,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-04-06 00:13:29,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:13:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2003330107, now seen corresponding path program 1 times [2024-04-06 00:13:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 00:13:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 00:13:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1913086250, now seen corresponding path program 4 times [2024-04-06 00:13:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:34,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:34,387 INFO L85 PathProgramCache]: Analyzing trace with hash 378710842, now seen corresponding path program 1 times [2024-04-06 00:13:34,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:34,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:13:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 00:13:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:13:41,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-04-06 00:13:41,662 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-04-06 00:13:41,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:13:41,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-04-06 00:13:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:13:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996104757] [2024-04-06 00:13:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-04-06 00:13:42,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:13:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996104757] [2024-04-06 00:13:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996104757] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:13:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811241166] [2024-04-06 00:13:42,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 00:13:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:13:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:13:42,108 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-04-06 00:13:42,110 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-04-06 00:13:42,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 00:13:42,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 00:13:42,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-04-06 00:13:42,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:13:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-04-06 00:13:42,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-06 00:13:42,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811241166] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:13:42,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-06 00:13:42,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-04-06 00:13:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160944693] [2024-04-06 00:13:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:13:42,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 00:13:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:13:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 00:13:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-04-06 00:13:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:13:42,282 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:13:42,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-04-06 00:13:42,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:13:42,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:13:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1744940568, now seen corresponding path program 1 times [2024-04-06 00:13:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 00:13:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-06 00:13:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1102317186, now seen corresponding path program 5 times [2024-04-06 00:13:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:47,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1474389333, now seen corresponding path program 6 times [2024-04-06 00:13:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:48,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1071151874, now seen corresponding path program 1 times [2024-04-06 00:13:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 00:13:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 00:13:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 675512790, now seen corresponding path program 7 times [2024-04-06 00:13:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:53,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:13:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:13:53,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-06 00:13:53,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 00:13:53,891 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-04-06 00:13:53,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:13:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-04-06 00:13:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:13:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519937726] [2024-04-06 00:13:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-04-06 00:13:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:13:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519937726] [2024-04-06 00:13:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519937726] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:13:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180709331] [2024-04-06 00:13:54,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-06 00:13:54,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:13:54,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:13:54,196 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-04-06 00:13:54,260 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-04-06 00:13:54,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-06 00:13:54,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 00:13:54,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2024-04-06 00:13:54,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:13:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-04-06 00:13:54,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:13:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 175 proven. 19 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-04-06 00:13:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180709331] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:13:54,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:13:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 18 [2024-04-06 00:13:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796062997] [2024-04-06 00:13:54,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:13:54,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-06 00:13:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:13:54,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-06 00:13:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-04-06 00:13:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:13:54,772 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:13:54,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.055555555555555) internal successors, (163), 18 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 00:13:54,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:13:54,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:13:54,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:13:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 358668392, now seen corresponding path program 8 times [2024-04-06 00:13:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:56,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:13:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:13:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash -464857487, now seen corresponding path program 1 times [2024-04-06 00:13:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:13:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 50 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 00:13:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:13:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:13:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 00:14:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash 262083163, now seen corresponding path program 9 times [2024-04-06 00:14:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:00,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1531332640, now seen corresponding path program 10 times [2024-04-06 00:14:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:01,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1868535309, now seen corresponding path program 11 times [2024-04-06 00:14:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:01,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -621544787, now seen corresponding path program 2 times [2024-04-06 00:14:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 97 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 00:14:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 10 proven. 114 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 00:14:10,345 INFO L85 PathProgramCache]: Analyzing trace with hash -341462864, now seen corresponding path program 3 times [2024-04-06 00:14:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 00:14:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:14:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2037223481, now seen corresponding path program 4 times [2024-04-06 00:14:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:14:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:14:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1397608214, now seen corresponding path program 1 times [2024-04-06 00:14:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:26,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:26,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1266077439, now seen corresponding path program 2 times [2024-04-06 00:14:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 5 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 00:14:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 41 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-06 00:14:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1633960745, now seen corresponding path program 3 times [2024-04-06 00:14:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:36,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1748423005, now seen corresponding path program 12 times [2024-04-06 00:14:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:36,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1510008993, now seen corresponding path program 13 times [2024-04-06 00:14:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:36,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1048789295, now seen corresponding path program 14 times [2024-04-06 00:14:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:37,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:14:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:14:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 695154684, now seen corresponding path program 1 times [2024-04-06 00:14:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 21 proven. 85 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-04-06 00:14:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 111 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 00:14:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1774592265, now seen corresponding path program 2 times [2024-04-06 00:14:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 12 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:14:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:14:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 5 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:14:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1479023435, now seen corresponding path program 1 times [2024-04-06 00:14:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:14:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:14:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 00:15:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 00:15:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -275433463, now seen corresponding path program 15 times [2024-04-06 00:15:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:15:07,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 00:15:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 00:15:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash -189450923, now seen corresponding path program 5 times [2024-04-06 00:15:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-04-06 00:15:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-04-06 00:15:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:15:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:15:08,588 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-04-06 00:15:08,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable19,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable20,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable44,SelfDestructingSolverStorable23,SelfDestructingSolverStorable45,SelfDestructingSolverStorable24,SelfDestructingSolverStorable46,SelfDestructingSolverStorable25,SelfDestructingSolverStorable47,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-06 00:15:08,777 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-04-06 00:15:08,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:15:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1189536946, now seen corresponding path program 4 times [2024-04-06 00:15:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:15:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144140235] [2024-04-06 00:15:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-04-06 00:15:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:15:09,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144140235] [2024-04-06 00:15:09,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144140235] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:15:09,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:15:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-06 00:15:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364948836] [2024-04-06 00:15:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:15:09,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-06 00:15:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:15:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-06 00:15:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-06 00:15:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:15:09,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:15:09,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-04-06 00:15:09,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:09,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:15:09,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:15:09,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:15:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:15:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:15:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:09,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-04-06 00:15:09,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 00:15:09,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:15:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1960909666, now seen corresponding path program 5 times [2024-04-06 00:15:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:15:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808434419] [2024-04-06 00:15:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 855 proven. 10 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2024-04-06 00:15:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:15:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808434419] [2024-04-06 00:15:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808434419] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:15:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666312978] [2024-04-06 00:15:10,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-06 00:15:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:15:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:15:10,376 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-04-06 00:15:10,377 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-04-06 00:15:10,638 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-04-06 00:15:10,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 00:15:10,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2024-04-06 00:15:10,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:15:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 833 proven. 110 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2024-04-06 00:15:10,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:15:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 826 proven. 4 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2024-04-06 00:15:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666312978] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:15:10,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:15:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-04-06 00:15:10,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169160386] [2024-04-06 00:15:10,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:15:10,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-04-06 00:15:10,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:15:10,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-04-06 00:15:10,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-04-06 00:15:10,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:15:10,815 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:15:10,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04-06 00:15:10,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:10,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:15:10,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:15:10,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:10,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:15:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:15:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:15:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:15:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-06 00:15:11,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-06 00:15:12,151 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,SelfDestructingSolverStorable49 [2024-04-06 00:15:12,152 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 00:15:12,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:15:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1091151426, now seen corresponding path program 6 times [2024-04-06 00:15:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:15:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98693097] [2024-04-06 00:15:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:15:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:15:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:15:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 910 proven. 1006 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-04-06 00:15:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:15:27,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98693097] [2024-04-06 00:15:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98693097] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:15:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521661071] [2024-04-06 00:15:27,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-04-06 00:15:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:15:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:15:27,055 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 00:15:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-06 00:15:27,448 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-04-06 00:15:27,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 00:15:27,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 143 conjunts are in the unsatisfiable core [2024-04-06 00:15:27,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:17:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 183 proven. 1764 refuted. 12 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-06 00:17:36,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:17:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 196 proven. 1799 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:17:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521661071] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:17:43,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:17:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 88, 115] total 276 [2024-04-06 00:17:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933055057] [2024-04-06 00:17:43,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:17:43,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 276 states [2024-04-06 00:17:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:17:43,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 276 interpolants. [2024-04-06 00:17:43,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17712, Invalid=58163, Unknown=25, NotChecked=0, Total=75900 [2024-04-06 00:17:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:17:43,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:17:43,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 276 states, 276 states have (on average 2.7717391304347827) internal successors, (765), 276 states have internal predecessors, (765), 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-04-06 00:17:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:17:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:17:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:17:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:17:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-06 00:17:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:18:26,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 00:19:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:19:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:19:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:19:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:19:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-06 00:19:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 454 states. [2024-04-06 00:19:17,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-04-06 00:19:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2024-04-06 00:19:18,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 00:19:18,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:19:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1607960150, now seen corresponding path program 7 times [2024-04-06 00:19:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:19:18,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305024274] [2024-04-06 00:19:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:19:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:19:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:19:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 945 proven. 3 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-04-06 00:19:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:19:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305024274] [2024-04-06 00:19:18,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305024274] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:19:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829730306] [2024-04-06 00:19:18,660 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-04-06 00:19:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:19:18,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:19:18,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 00:19:18,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-06 00:19:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:19:18,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 17 conjunts are in the unsatisfiable core [2024-04-06 00:19:18,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:19:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 852 proven. 1 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2024-04-06 00:19:18,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:19:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 844 proven. 99 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2024-04-06 00:19:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829730306] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:19:19,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:19:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 11] total 18 [2024-04-06 00:19:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088305156] [2024-04-06 00:19:19,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:19:19,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-06 00:19:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:19:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-06 00:19:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-04-06 00:19:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:19:19,137 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:19:19,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.166666666666666) internal successors, (183), 18 states have internal predecessors, (183), 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-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 454 states. [2024-04-06 00:19:19,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 476 states. [2024-04-06 00:19:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-06 00:19:21,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-06 00:19:21,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:19:21,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 00:19:21,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:19:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2136770853, now seen corresponding path program 8 times [2024-04-06 00:19:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:19:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809874502] [2024-04-06 00:19:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:19:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:19:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:19:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 166 proven. 380 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-06 00:19:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:19:26,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809874502] [2024-04-06 00:19:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809874502] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:19:26,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369159512] [2024-04-06 00:19:26,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 00:19:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:19:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:19:26,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 00:19:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-06 00:19:27,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 00:19:27,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 00:19:27,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 60 conjunts are in the unsatisfiable core [2024-04-06 00:19:27,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:21:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 155 proven. 350 refuted. 23 times theorem prover too weak. 48 trivial. 0 not checked. [2024-04-06 00:21:10,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:21:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:21:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369159512] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:21:15,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:21:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 33, 52] total 134 [2024-04-06 00:21:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953663746] [2024-04-06 00:21:15,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:21:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2024-04-06 00:21:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:21:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2024-04-06 00:21:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1519, Invalid=16274, Unknown=29, NotChecked=0, Total=17822 [2024-04-06 00:21:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:21:15,458 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:21:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 3.656716417910448) internal successors, (490), 134 states have internal predecessors, (490), 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-04-06 00:21:15,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 476 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-06 00:21:15,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:21:24,382 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-04-06 00:21:30,434 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-04-06 00:21:52,029 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-04-06 00:22:30,156 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 112 DAG size of output: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:22:48,291 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse18 (* 4294967292 c_~m~0))) (let ((.cse4 (mod (+ .cse18 c_~p2~0) 4294967296)) (.cse16 (mod (+ .cse18 c_~p1~0) 4294967296))) (let ((.cse10 (= .cse4 .cse16)) (.cse2 (<= c_~n1~0 0)) (.cse0 (div c_thread1Thread1of1ForFork3_~cond~0 256)) (.cse7 (mod (+ (* c_~m~0 4294967293) c_~p1~0) 4294967296)) (.cse9 (= 2 c_~n2~0)) (.cse12 (<= 3 c_~n2~0)) (.cse3 (= (+ 3 c_~n1~0) c_~n2~0)) (.cse5 (= c_~n2~0 1)) (.cse8 (* c_~m~0 4294967294)) (.cse6 (= c_~n1~0 0)) (.cse1 (<= c_~n2~0 0)) (.cse11 (= c_~n2~0 c_~n1~0))) (and (or (and (<= .cse0 0) (<= 1 c_thread1Thread1of1ForFork3_~cond~0)) (< c_~n2~0 5)) (or (and (= c_thread4Thread1of1ForFork0_~cond~3 1) (<= 1 c_~n2~0)) (and .cse1 (= c_thread4Thread1of1ForFork0_~cond~3 0))) (or (and .cse2 (= 0 c_thread1Thread1of1ForFork3_~cond~0)) (and (= 1 c_thread1Thread1of1ForFork3_~cond~0) (<= 1 c_~n1~0))) (or (and (<= 0 c_~n1~0) .cse3 (= (mod (+ (* c_~m~0 4294967289) c_~p1~0) 4294967296) .cse4)) (and .cse2 (or (and .cse5 .cse6 (= .cse7 (mod (+ .cse8 c_~p2~0) 4294967296))) (and (= (mod (+ (* 4294967290 c_~m~0) c_~p1~0) 4294967296) .cse4) .cse6 .cse9) (and .cse10 .cse11)))) (let ((.cse13 (* 4294967295 c_~p2~0)) (.cse14 (* (mod (* 2147483645 c_~m~0) 2147483648) 2))) (or (and .cse10 .cse2 .cse11) (and .cse12 .cse3 (= (mod (+ .cse13 .cse14 (* c_~m~0 3) c_~p1~0) 4294967296) 0)) (and (= (mod (+ .cse13 .cse14 c_~p1~0 (* c_~m~0 4)) 4294967296) 0) .cse6 .cse9) (and (= .cse4 (mod (+ c_~p1~0 (* 4294967291 c_~m~0)) 4294967296)) .cse5 .cse6))) (or (< c_thread1Thread1of1ForFork3_~cond~0 (+ (* .cse0 256) 1)) .cse3) (let ((.cse17 (* c_~m~0 4294967295))) (let ((.cse15 (mod (+ .cse17 c_~p2~0) 4294967296))) (or (and (= .cse7 .cse15) .cse6 .cse9) (and .cse12 .cse3 (= .cse16 .cse15)) (and .cse5 (= (mod (+ .cse8 c_~p1~0) 4294967296) .cse15) .cse6) (and .cse1 (= (mod (+ .cse17 c_~p1~0) 4294967296) .cse15) .cse11)))))))) is different from true [2024-04-06 00:23:10,565 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-04-06 00:23:12,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-04-06 00:23:14,604 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-04-06 00:23:16,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 00:23:18,358 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-04-06 00:24:02,837 WARN L293 SmtUtils]: Spent 15.90s on a formula simplification. DAG size of input: 142 DAG size of output: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:24:12,081 WARN L293 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 136 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:24:28,922 WARN L293 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 130 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:24:30,320 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-04-06 00:24:32,326 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-04-06 00:24:34,422 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-04-06 00:24:47,290 WARN L293 SmtUtils]: Spent 10.43s on a formula simplification. DAG size of input: 161 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:24:56,663 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 136 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:24:58,756 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-04-06 00:24:59,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 00:25:01,982 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-04-06 00:25:11,968 WARN L293 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 254 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:25:13,973 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-04-06 00:25:19,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-04-06 00:25:26,612 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-04-06 00:25:27,825 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-04-06 00:25:41,918 WARN L293 SmtUtils]: Spent 11.95s on a formula simplification. DAG size of input: 151 DAG size of output: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:25:43,973 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-04-06 00:25:46,024 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-04-06 00:25:48,047 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-04-06 00:25:49,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 00:25:57,030 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-04-06 00:25:59,070 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-04-06 00:26:01,082 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-04-06 00:26:13,111 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 257 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:26:19,436 WARN L293 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 152 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:26:21,831 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-04-06 00:26:35,245 WARN L293 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 144 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:26:37,263 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-04-06 00:26:39,309 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-04-06 00:26:41,695 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-04-06 00:26:59,777 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 147 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 00:27:07,958 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-04-06 00:27:09,975 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-04-06 00:27:11,984 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 [] Received shutdown request... [2024-04-06 00:27:25,513 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-04-06 00:27:25,513 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-06 00:27:25,514 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-04-06 00:27:25,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-06 00:27:26,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-04-06 00:27:26,058 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 240 known predicates. [2024-04-06 00:27:26,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-04-06 00:27:26,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-06 00:27:26,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-06 00:27:26,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-06 00:27:26,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-06 00:27:26,064 INFO L445 BasicCegarLoop]: Path program histogram: [15, 8, 5, 3, 2, 1, 1, 1, 1, 1, 1] [2024-04-06 00:27:26,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-06 00:27:26,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-06 00:27:26,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 12:27:26 BasicIcfg [2024-04-06 00:27:26,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-06 00:27:26,068 INFO L158 Benchmark]: Toolchain (without parser) took 841192.42ms. Allocated memory was 302.0MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 269.0MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 333.8MB. Max. memory is 8.0GB. [2024-04-06 00:27:26,069 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 00:27:26,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.77ms. Allocated memory is still 302.0MB. Free memory was 269.0MB in the beginning and 256.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-06 00:27:26,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.02ms. Allocated memory is still 302.0MB. Free memory was 256.9MB in the beginning and 255.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 00:27:26,069 INFO L158 Benchmark]: Boogie Preprocessor took 71.23ms. Allocated memory is still 302.0MB. Free memory was 255.4MB in the beginning and 268.6MB in the end (delta: -13.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-06 00:27:26,069 INFO L158 Benchmark]: RCFGBuilder took 410.88ms. Allocated memory is still 302.0MB. Free memory was 268.6MB in the beginning and 246.4MB in the end (delta: 22.2MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-04-06 00:27:26,070 INFO L158 Benchmark]: TraceAbstraction took 840427.15ms. Allocated memory was 302.0MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 244.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 310.2MB. Max. memory is 8.0GB. [2024-04-06 00:27:26,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.77ms. Allocated memory is still 302.0MB. Free memory was 269.0MB in the beginning and 256.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.02ms. Allocated memory is still 302.0MB. Free memory was 256.9MB in the beginning and 255.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.23ms. Allocated memory is still 302.0MB. Free memory was 255.4MB in the beginning and 268.6MB in the end (delta: -13.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 410.88ms. Allocated memory is still 302.0MB. Free memory was 268.6MB in the beginning and 246.4MB in the end (delta: 22.2MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 840427.15ms. Allocated memory was 302.0MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 244.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 310.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 558300, independent: 500226, independent conditional: 494862, independent unconditional: 5364, dependent: 58074, dependent conditional: 55426, dependent unconditional: 2648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 510896, independent: 500226, independent conditional: 494862, independent unconditional: 5364, dependent: 10670, dependent conditional: 10507, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 510896, independent: 500226, independent conditional: 494862, independent unconditional: 5364, dependent: 10670, dependent conditional: 10507, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 510896, independent: 500226, independent conditional: 494862, independent unconditional: 5364, dependent: 10670, dependent conditional: 10507, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 544234, independent: 500226, independent conditional: 31207, independent unconditional: 469019, dependent: 44008, dependent conditional: 24876, dependent unconditional: 19132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 544234, independent: 500226, independent conditional: 29100, independent unconditional: 471126, dependent: 44008, dependent conditional: 10496, dependent unconditional: 33512, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 544234, independent: 500226, independent conditional: 29100, independent unconditional: 471126, dependent: 44008, dependent conditional: 10496, dependent unconditional: 33512, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1059, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 91, dependent conditional: 79, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1059, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 91, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 91, dependent conditional: 79, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 91, dependent conditional: 79, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1565, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1565, dependent conditional: 844, dependent unconditional: 722, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 544234, independent: 499258, independent conditional: 29100, independent unconditional: 470158, dependent: 43917, dependent conditional: 10417, dependent unconditional: 33500, unknown: 1059, unknown conditional: 79, unknown unconditional: 980] , Statistics on independence cache: Total cache size (in pairs): 1059, Positive cache size: 968, Positive conditional cache size: 0, Positive unconditional cache size: 968, Negative cache size: 91, Negative conditional cache size: 79, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16487, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 544234, independent: 500226, independent conditional: 31207, independent unconditional: 469019, dependent: 44008, dependent conditional: 24876, dependent unconditional: 19132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 544234, independent: 500226, independent conditional: 29100, independent unconditional: 471126, dependent: 44008, dependent conditional: 10496, dependent unconditional: 33512, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 544234, independent: 500226, independent conditional: 29100, independent unconditional: 471126, dependent: 44008, dependent conditional: 10496, dependent unconditional: 33512, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1059, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 91, dependent conditional: 79, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1059, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 91, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 91, dependent conditional: 79, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 91, dependent conditional: 79, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1565, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1565, dependent conditional: 844, dependent unconditional: 722, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 544234, independent: 499258, independent conditional: 29100, independent unconditional: 470158, dependent: 43917, dependent conditional: 10417, dependent unconditional: 33500, unknown: 1059, unknown conditional: 79, unknown unconditional: 980] , Statistics on independence cache: Total cache size (in pairs): 1059, Positive cache size: 968, Positive conditional cache size: 0, Positive unconditional cache size: 968, Negative cache size: 91, Negative conditional cache size: 79, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16487 ], Independence queries for same thread: 47404 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 240 known predicates. - TimeoutResultAtElement [Line: 129]: 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 240 known predicates. - TimeoutResultAtElement [Line: 130]: 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 240 known predicates. - TimeoutResultAtElement [Line: 132]: 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 240 known predicates. - TimeoutResultAtElement [Line: 131]: 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 240 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 840.3s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 15, EmptinessCheckTime: 569.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 703, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 267.4s InterpolantComputationTime, 3372 NumberOfCodeBlocks, 3215 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 4670 ConstructedInterpolants, 0 QuantifiedInterpolants, 38308 SizeOfPredicates, 79 NumberOfNonLiveVariables, 2435 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 14970/21138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown