/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 FORWARD --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/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 03:02:32,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 03:02:32,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 03:02:32,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 03:02:32,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 03:02:32,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 03:02:32,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 03:02:32,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 03:02:32,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 03:02:32,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 03:02:32,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 03:02:32,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 03:02:32,960 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 03:02:32,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 03:02:32,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 03:02:32,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 03:02:32,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 03:02:32,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 03:02:32,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 03:02:32,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 03:02:32,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 03:02:32,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 03:02:32,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 03:02:32,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 03:02:32,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 03:02:32,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 03:02:32,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 03:02:32,969 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 03:02:32,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 03:02:32,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 03:02:32,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 03:02:32,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 03:02:32,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 03:02:32,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 03:02:32,971 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 03:02:32,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 03:02:32,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 03:02:32,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 03:02:32,972 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 03:02:32,972 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 -> FORWARD 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-05-07 03:02:33,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 03:02:33,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 03:02:33,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 03:02:33,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 03:02:33,243 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 03:02:33,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-07 03:02:34,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 03:02:34,578 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 03:02:34,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-07 03:02:34,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bcd18fa14/6d8c6279241d40f6934422fbe5abdfd2/FLAG68a346a72 [2024-05-07 03:02:34,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bcd18fa14/6d8c6279241d40f6934422fbe5abdfd2 [2024-05-07 03:02:34,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 03:02:34,604 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 03:02:34,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 03:02:34,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 03:02:34,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 03:02:34,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5103b9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34, skipping insertion in model container [2024-05-07 03:02:34,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,637 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 03:02:34,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-07 03:02:34,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 03:02:34,785 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 03:02:34,805 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-07 03:02:34,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 03:02:34,813 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 03:02:34,813 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 03:02:34,818 INFO L206 MainTranslator]: Completed translation [2024-05-07 03:02:34,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34 WrapperNode [2024-05-07 03:02:34,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 03:02:34,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 03:02:34,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 03:02:34,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 03:02:34,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,849 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-05-07 03:02:34,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 03:02:34,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 03:02:34,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 03:02:34,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 03:02:34,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 03:02:34,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 03:02:34,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 03:02:34,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 03:02:34,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (1/1) ... [2024-05-07 03:02:34,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 03:02:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:02:34,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 03:02:34,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 03:02:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 03:02:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 03:02:34,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 03:02:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 03:02:34,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 03:02:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-07 03:02:34,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-07 03:02:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 03:02:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 03:02:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 03:02:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 03:02:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 03:02:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 03:02:34,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 03:02:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 03:02:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 03:02:34,949 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 03:02:35,024 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 03:02:35,026 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 03:02:35,251 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 03:02:35,316 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 03:02:35,317 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-07 03:02:35,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 03:02:35 BoogieIcfgContainer [2024-05-07 03:02:35,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 03:02:35,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 03:02:35,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 03:02:35,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 03:02:35,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 03:02:34" (1/3) ... [2024-05-07 03:02:35,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7892b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 03:02:35, skipping insertion in model container [2024-05-07 03:02:35,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:02:34" (2/3) ... [2024-05-07 03:02:35,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7892b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 03:02:35, skipping insertion in model container [2024-05-07 03:02:35,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 03:02:35" (3/3) ... [2024-05-07 03:02:35,327 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-05-07 03:02:35,333 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 03:02:35,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 03:02:35,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 03:02:35,341 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 03:02:35,396 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-07 03:02:35,439 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 03:02:35,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 03:02:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:02:35,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 03:02:35,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 03:02:35,480 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 03:02:35,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:02:35,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 03:02:35,500 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;@6b18a94a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 03:02:35,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 03:02:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 1 times [2024-05-07 03:02:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:36,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 2 times [2024-05-07 03:02:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:37,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -319144639, now seen corresponding path program 3 times [2024-05-07 03:02:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:38,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 4 times [2024-05-07 03:02:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:38,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 5 times [2024-05-07 03:02:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:38,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 444321258, now seen corresponding path program 6 times [2024-05-07 03:02:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:39,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 1 times [2024-05-07 03:02:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910019, now seen corresponding path program 2 times [2024-05-07 03:02:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 03:02:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:43,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 03:02:43,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:02:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1121987728, now seen corresponding path program 1 times [2024-05-07 03:02:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:02:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511172856] [2024-05-07 03:02:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 03:02:43,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:02:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511172856] [2024-05-07 03:02:43,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511172856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:02:43,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:02:43,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 03:02:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229351303] [2024-05-07 03:02:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:02:43,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 03:02:43,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:02:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 03:02:43,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 03:02:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:43,258 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:02:43,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:02:43,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 7 times [2024-05-07 03:02:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:43,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 8 times [2024-05-07 03:02:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:43,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -319144639, now seen corresponding path program 9 times [2024-05-07 03:02:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:43,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 10 times [2024-05-07 03:02:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 11 times [2024-05-07 03:02:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash 444321258, now seen corresponding path program 12 times [2024-05-07 03:02:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 3 times [2024-05-07 03:02:44,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:44,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910019, now seen corresponding path program 4 times [2024-05-07 03:02:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-07 03:02:48,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 03:02:48,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:02:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1005987980, now seen corresponding path program 1 times [2024-05-07 03:02:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:02:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274214047] [2024-05-07 03:02:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:02:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274214047] [2024-05-07 03:02:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274214047] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:02:48,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533968335] [2024-05-07 03:02:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:48,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:02:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:02:48,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 03:02:48,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 03:02:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:48,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-07 03:02:48,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:02:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 03:02:49,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 03:02:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533968335] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:02:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 03:02:49,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2024-05-07 03:02:49,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474793837] [2024-05-07 03:02:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:02:49,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 03:02:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:02:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 03:02:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-07 03:02:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:49,108 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:02:49,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:02:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 530136904, now seen corresponding path program 1 times [2024-05-07 03:02:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:49,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash 848385164, now seen corresponding path program 2 times [2024-05-07 03:02:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:49,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash 530136566, now seen corresponding path program 3 times [2024-05-07 03:02:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1527607113, now seen corresponding path program 4 times [2024-05-07 03:02:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1336195669, now seen corresponding path program 5 times [2024-05-07 03:02:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1527606955, now seen corresponding path program 6 times [2024-05-07 03:02:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:50,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:02:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:02:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1656362122, now seen corresponding path program 1 times [2024-05-07 03:02:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 03:02:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1656361784, now seen corresponding path program 2 times [2024-05-07 03:02:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 03:02:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:02:55,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-07 03:02:55,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 03:02:55,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 03:02:55,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:02:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1498311593, now seen corresponding path program 1 times [2024-05-07 03:02:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:02:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629438378] [2024-05-07 03:02:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:02:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 03:02:55,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:02:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629438378] [2024-05-07 03:02:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629438378] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:02:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213914721] [2024-05-07 03:02:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:02:55,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:02:55,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:02:55,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 03:02:55,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 03:02:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:02:55,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-07 03:02:55,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:02:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 03:02:57,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 03:02:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:02:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213914721] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 03:02:58,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 03:02:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2024-05-07 03:02:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36071859] [2024-05-07 03:02:58,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 03:02:58,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-07 03:02:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:02:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-07 03:02:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2024-05-07 03:02:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:58,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:02:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:02:58,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:02:58,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:02:58,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:03:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1836411268, now seen corresponding path program 3 times [2024-05-07 03:03:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:03:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-07 03:03:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:03:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 1 proven. 144 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-07 03:03:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -765074951, now seen corresponding path program 4 times [2024-05-07 03:03:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:03:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 03:03:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:03:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 54 proven. 107 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 03:03:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:03:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:03:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-05-07 03:03:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 03:03:30,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36 [2024-05-07 03:03:30,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 03:03:30,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:03:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash 382352847, now seen corresponding path program 2 times [2024-05-07 03:03:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:03:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73984226] [2024-05-07 03:03:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:03:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-05-07 03:03:33,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:03:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73984226] [2024-05-07 03:03:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73984226] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:03:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313650840] [2024-05-07 03:03:33,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 03:03:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:03:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:03:33,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 03:03:33,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-07 03:03:33,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 03:03:33,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 03:03:33,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-07 03:03:33,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:03:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 70 proven. 43 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-05-07 03:03:34,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 03:03:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-05-07 03:03:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313650840] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 03:03:34,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 03:03:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 6] total 42 [2024-05-07 03:03:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421739476] [2024-05-07 03:03:34,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 03:03:34,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-07 03:03:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:03:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-07 03:03:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2024-05-07 03:03:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:03:34,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:03:34,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.642857142857143) internal successors, (195), 42 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:03:34,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:03:34,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:03:34,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-05-07 03:03:34,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:03:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash -21838763, now seen corresponding path program 7 times [2024-05-07 03:03:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:41,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:03:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2058270584, now seen corresponding path program 8 times [2024-05-07 03:03:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:44,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:03:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:46,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:03:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1309373301, now seen corresponding path program 9 times [2024-05-07 03:03:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:47,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:03:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1969454150, now seen corresponding path program 10 times [2024-05-07 03:03:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:03:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:03:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:03:48,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 03:03:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 03:04:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:04:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:04:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-07 03:04:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2024-05-07 03:04:10,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-07 03:04:10,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-07 03:04:10,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 03:04:10,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:04:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -412646562, now seen corresponding path program 3 times [2024-05-07 03:04:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:04:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144568579] [2024-05-07 03:04:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:04:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:04:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:04:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 5 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:04:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:04:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144568579] [2024-05-07 03:04:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144568579] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:04:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64620757] [2024-05-07 03:04:16,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-07 03:04:16,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:04:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:04:16,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 03:04:16,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-07 03:04:16,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-07 03:04:16,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 03:04:16,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-07 03:04:16,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:04:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-05-07 03:04:16,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 03:04:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-05-07 03:04:16,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64620757] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 03:04:16,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 03:04:16,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 6, 6] total 63 [2024-05-07 03:04:16,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428766112] [2024-05-07 03:04:16,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 03:04:16,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-05-07 03:04:16,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:04:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-05-07 03:04:16,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3709, Unknown=0, NotChecked=0, Total=3906 [2024-05-07 03:04:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:04:16,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:04:16,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.3492063492063493) internal successors, (211), 63 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:04:16,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:04:16,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:04:16,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-07 03:04:16,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 235 states. [2024-05-07 03:04:16,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:04:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:04:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:04:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-07 03:04:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2024-05-07 03:04:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-05-07 03:04:41,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-07 03:04:41,264 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,SelfDestructingSolverStorable42 [2024-05-07 03:04:41,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 03:04:41,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:04:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -976372502, now seen corresponding path program 4 times [2024-05-07 03:04:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:04:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769577728] [2024-05-07 03:04:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:04:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:04:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:04:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 1 proven. 461 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:04:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:04:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769577728] [2024-05-07 03:04:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769577728] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:04:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926136409] [2024-05-07 03:04:47,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-07 03:04:47,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:04:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:04:47,400 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-05-07 03:04:47,401 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-05-07 03:04:47,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-07 03:04:47,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 03:04:47,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjunts are in the unsatisfiable core [2024-05-07 03:04:47,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:08:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 449 refuted. 13 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:08:56,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 03:09:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:09:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926136409] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 03:09:58,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 03:09:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 40, 39] total 137 [2024-05-07 03:09:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367782035] [2024-05-07 03:09:58,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 03:09:58,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2024-05-07 03:09:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:09:58,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2024-05-07 03:09:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=16911, Unknown=8, NotChecked=0, Total=18632 [2024-05-07 03:09:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:09:58,928 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:09:58,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 137 states have (on average 2.854014598540146) internal successors, (391), 137 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:09:58,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:09:58,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 03:09:58,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-07 03:09:58,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 246 states. [2024-05-07 03:09:58,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-05-07 03:09:58,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:10:31,735 WARN L293 SmtUtils]: Spent 13.20s on a formula simplification. DAG size of input: 158 DAG size of output: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 03:11:56,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:07,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:08,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:10,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:12,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:30,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:32,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:13:33,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:14:36,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:14:42,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:14:44,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:14:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:14:58,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:00,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:16,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:17,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:28,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:40,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:42,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:44,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:15:47,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:16:16,856 WARN L293 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 177 DAG size of output: 26 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 03:16:20,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:16:22,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:16:24,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 03:16:32,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-05-07 03:16:33,789 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 03:16:33,790 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 03:16:33,790 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 03:16:33,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-07 03:16:34,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:16:34,010 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 209 known predicates. [2024-05-07 03:16:34,012 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 03:16:34,012 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 03:16:34,013 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 03:16:34,013 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 03:16:34,016 INFO L448 BasicCegarLoop]: Path program histogram: [12, 10, 4, 4, 4, 1, 1] [2024-05-07 03:16:34,019 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 03:16:34,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 03:16:34,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 03:16:34 BasicIcfg [2024-05-07 03:16:34,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 03:16:34,023 INFO L158 Benchmark]: Toolchain (without parser) took 839419.57ms. Allocated memory was 280.0MB in the beginning and 906.0MB in the end (delta: 626.0MB). Free memory was 208.9MB in the beginning and 450.4MB in the end (delta: -241.5MB). Peak memory consumption was 385.4MB. Max. memory is 8.0GB. [2024-05-07 03:16:34,024 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 158.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 03:16:34,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.63ms. Allocated memory is still 280.0MB. Free memory was 208.9MB in the beginning and 197.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-07 03:16:34,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.61ms. Allocated memory is still 280.0MB. Free memory was 197.3MB in the beginning and 195.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 03:16:34,024 INFO L158 Benchmark]: Boogie Preprocessor took 27.53ms. Allocated memory is still 280.0MB. Free memory was 195.7MB in the beginning and 194.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 03:16:34,024 INFO L158 Benchmark]: RCFGBuilder took 440.33ms. Allocated memory is still 280.0MB. Free memory was 194.2MB in the beginning and 241.0MB in the end (delta: -46.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-05-07 03:16:34,025 INFO L158 Benchmark]: TraceAbstraction took 838702.25ms. Allocated memory was 280.0MB in the beginning and 906.0MB in the end (delta: 626.0MB). Free memory was 239.9MB in the beginning and 450.4MB in the end (delta: -210.4MB). Peak memory consumption was 416.1MB. Max. memory is 8.0GB. [2024-05-07 03:16:34,027 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.12ms. Allocated memory is still 158.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.63ms. Allocated memory is still 280.0MB. Free memory was 208.9MB in the beginning and 197.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.61ms. Allocated memory is still 280.0MB. Free memory was 197.3MB in the beginning and 195.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.53ms. Allocated memory is still 280.0MB. Free memory was 195.7MB in the beginning and 194.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 440.33ms. Allocated memory is still 280.0MB. Free memory was 194.2MB in the beginning and 241.0MB in the end (delta: -46.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 838702.25ms. Allocated memory was 280.0MB in the beginning and 906.0MB in the end (delta: 626.0MB). Free memory was 239.9MB in the beginning and 450.4MB in the end (delta: -210.4MB). Peak memory consumption was 416.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16212, independent: 14828, independent conditional: 13000, independent unconditional: 1828, dependent: 1349, dependent conditional: 1331, dependent unconditional: 18, unknown: 35, unknown conditional: 26, unknown unconditional: 9] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15057, independent: 14828, independent conditional: 13000, independent unconditional: 1828, dependent: 194, dependent conditional: 176, dependent unconditional: 18, unknown: 35, unknown conditional: 26, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15057, independent: 14828, independent conditional: 13000, independent unconditional: 1828, dependent: 194, dependent conditional: 176, dependent unconditional: 18, unknown: 35, unknown conditional: 26, unknown unconditional: 9] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15057, independent: 14828, independent conditional: 13000, independent unconditional: 1828, dependent: 194, dependent conditional: 176, dependent unconditional: 18, unknown: 35, unknown conditional: 26, unknown unconditional: 9] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15493, independent: 14828, independent conditional: 4217, independent unconditional: 10611, dependent: 569, dependent conditional: 329, dependent unconditional: 240, unknown: 96, unknown conditional: 30, unknown unconditional: 66] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15493, independent: 14828, independent conditional: 4006, independent unconditional: 10822, dependent: 569, dependent conditional: 239, dependent unconditional: 330, unknown: 96, unknown conditional: 8, unknown unconditional: 88] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15493, independent: 14828, independent conditional: 4006, independent unconditional: 10822, dependent: 569, dependent conditional: 239, dependent unconditional: 330, unknown: 96, unknown conditional: 8, unknown unconditional: 88] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 532, independent: 454, independent conditional: 16, independent unconditional: 438, dependent: 71, dependent conditional: 66, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 532, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 78, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 66, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 66, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8369, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1301, dependent conditional: 1221, dependent unconditional: 80, unknown: 7068, unknown conditional: 6052, unknown unconditional: 1016] , Protected Queries: 0 ], Cache Queries: [ total: 15493, independent: 14374, independent conditional: 3990, independent unconditional: 10384, dependent: 498, dependent conditional: 173, dependent unconditional: 325, unknown: 621, unknown conditional: 90, unknown unconditional: 531] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 454, Positive conditional cache size: 16, Positive unconditional cache size: 438, Negative cache size: 71, Negative conditional cache size: 66, Negative unconditional cache size: 5, Unknown cache size: 7, Unknown conditional cache size: 6, Unknown unconditional cache size: 1, Eliminated conditions: 323, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15493, independent: 14828, independent conditional: 4217, independent unconditional: 10611, dependent: 569, dependent conditional: 329, dependent unconditional: 240, unknown: 96, unknown conditional: 30, unknown unconditional: 66] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15493, independent: 14828, independent conditional: 4006, independent unconditional: 10822, dependent: 569, dependent conditional: 239, dependent unconditional: 330, unknown: 96, unknown conditional: 8, unknown unconditional: 88] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15493, independent: 14828, independent conditional: 4006, independent unconditional: 10822, dependent: 569, dependent conditional: 239, dependent unconditional: 330, unknown: 96, unknown conditional: 8, unknown unconditional: 88] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 532, independent: 454, independent conditional: 16, independent unconditional: 438, dependent: 71, dependent conditional: 66, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 532, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 78, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 66, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 66, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8369, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1301, dependent conditional: 1221, dependent unconditional: 80, unknown: 7068, unknown conditional: 6052, unknown unconditional: 1016] , Protected Queries: 0 ], Cache Queries: [ total: 15493, independent: 14374, independent conditional: 3990, independent unconditional: 10384, dependent: 498, dependent conditional: 173, dependent unconditional: 325, unknown: 621, unknown conditional: 90, unknown unconditional: 531] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 454, Positive conditional cache size: 16, Positive unconditional cache size: 438, Negative cache size: 71, Negative conditional cache size: 66, Negative unconditional cache size: 5, Unknown cache size: 7, Unknown conditional cache size: 6, Unknown unconditional cache size: 1, Eliminated conditions: 323 ], Independence queries for same thread: 1155 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 209 known predicates. - TimeoutResultAtElement [Line: 98]: 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 209 known predicates. - TimeoutResultAtElement [Line: 99]: 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 209 known predicates. - TimeoutResultAtElement [Line: 97]: 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 209 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 838.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 505.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: 558, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 331.1s InterpolantComputationTime, 1244 NumberOfCodeBlocks, 1187 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1735 ConstructedInterpolants, 0 QuantifiedInterpolants, 25332 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1215 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 1261/3144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 46.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 30, ConditionalCommutativityTraceChecks: 30, ConditionalCommutativityImperfectProofs: 8 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown