/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/pthread/fib_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 23:16:15,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 23:16:15,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 23:16:15,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 23:16:15,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 23:16:15,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 23:16:15,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 23:16:15,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 23:16:15,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 23:16:15,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 23:16:15,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 23:16:15,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 23:16:15,936 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 23:16:15,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 23:16:15,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 23:16:15,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 23:16:15,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 23:16:15,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 23:16:15,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 23:16:15,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 23:16:15,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 23:16:15,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 23:16:15,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 23:16:15,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 23:16:15,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 23:16:15,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 23:16:15,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 23:16:15,941 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 23:16:15,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 23:16:15,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 23:16:15,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 23:16:15,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 23:16:15,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 23:16:15,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 23:16:15,942 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 23:16:15,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 23:16:15,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 23:16:15,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 23:16:15,943 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 23:16:15,943 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-06 23:16:16,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 23:16:16,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 23:16:16,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 23:16:16,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 23:16:16,194 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 23:16:16,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2024-05-06 23:16:17,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 23:16:17,455 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 23:16:17,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2024-05-06 23:16:17,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d7a128798/120af34cccdc4c43af3dd5cd28fd2be8/FLAGd08241a4b [2024-05-06 23:16:17,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d7a128798/120af34cccdc4c43af3dd5cd28fd2be8 [2024-05-06 23:16:17,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 23:16:17,478 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 23:16:17,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 23:16:17,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 23:16:17,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 23:16:17,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523e393d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17, skipping insertion in model container [2024-05-06 23:16:17,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 23:16:17,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2024-05-06 23:16:17,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 23:16:17,795 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 23:16:17,822 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2024-05-06 23:16:17,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 23:16:17,863 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 23:16:17,863 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 23:16:17,869 INFO L206 MainTranslator]: Completed translation [2024-05-06 23:16:17,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17 WrapperNode [2024-05-06 23:16:17,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 23:16:17,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 23:16:17,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 23:16:17,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 23:16:17,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,916 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-05-06 23:16:17,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 23:16:17,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 23:16:17,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 23:16:17,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 23:16:17,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 23:16:17,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 23:16:17,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 23:16:17,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 23:16:17,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (1/1) ... [2024-05-06 23:16:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 23:16:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:17,983 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-06 23:16:18,008 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-06 23:16:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-06 23:16:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-06 23:16:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-06 23:16:18,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-06 23:16:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 23:16:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 23:16:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 23:16:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 23:16:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 23:16:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 23:16:18,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 23:16:18,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 23:16:18,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 23:16:18,035 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 23:16:18,170 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 23:16:18,171 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 23:16:18,350 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 23:16:18,357 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 23:16:18,357 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-06 23:16:18,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:16:18 BoogieIcfgContainer [2024-05-06 23:16:18,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 23:16:18,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 23:16:18,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 23:16:18,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 23:16:18,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:16:17" (1/3) ... [2024-05-06 23:16:18,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0b88e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:16:18, skipping insertion in model container [2024-05-06 23:16:18,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:16:17" (2/3) ... [2024-05-06 23:16:18,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0b88e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:16:18, skipping insertion in model container [2024-05-06 23:16:18,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:16:18" (3/3) ... [2024-05-06 23:16:18,365 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2024-05-06 23:16:18,371 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 23:16:18,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 23:16:18,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 23:16:18,379 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 23:16:18,436 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 23:16:18,477 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 23:16:18,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 23:16:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:18,480 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-06 23:16:18,500 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-06 23:16:18,527 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 23:16:18,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:18,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 23:16:18,545 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;@370fe812, 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-06 23:16:18,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-06 23:16:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 920930900, now seen corresponding path program 1 times [2024-05-06 23:16:18,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:18,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1818823887, now seen corresponding path program 2 times [2024-05-06 23:16:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 310184287, now seen corresponding path program 1 times [2024-05-06 23:16:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2019539270, now seen corresponding path program 2 times [2024-05-06 23:16:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1361992354, now seen corresponding path program 1 times [2024-05-06 23:16:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1458873881, now seen corresponding path program 2 times [2024-05-06 23:16:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1246410695, now seen corresponding path program 1 times [2024-05-06 23:16:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1476962782, now seen corresponding path program 2 times [2024-05-06 23:16:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1832526146, now seen corresponding path program 1 times [2024-05-06 23:16:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2125856643, now seen corresponding path program 2 times [2024-05-06 23:16:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash -397354433, now seen corresponding path program 1 times [2024-05-06 23:16:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1038408806, now seen corresponding path program 2 times [2024-05-06 23:16:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:19,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:20,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1184059601, now seen corresponding path program 1 times [2024-05-06 23:16:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176137970] [2024-05-06 23:16:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:16:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176137970] [2024-05-06 23:16:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176137970] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:16:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 23:16:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-06 23:16:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373071922] [2024-05-06 23:16:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:16:20,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 23:16:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:16:20,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 23:16:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 23:16:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:20,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:16:20,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-06 23:16:20,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash 227468881, now seen corresponding path program 1 times [2024-05-06 23:16:20,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash -317715180, now seen corresponding path program 2 times [2024-05-06 23:16:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -394829268, now seen corresponding path program 3 times [2024-05-06 23:16:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1513772121, now seen corresponding path program 4 times [2024-05-06 23:16:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2108893497, now seen corresponding path program 5 times [2024-05-06 23:16:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1018665260, now seen corresponding path program 6 times [2024-05-06 23:16:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1998895504, now seen corresponding path program 7 times [2024-05-06 23:16:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1075515787, now seen corresponding path program 8 times [2024-05-06 23:16:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 162201649, now seen corresponding path program 9 times [2024-05-06 23:16:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1350780724, now seen corresponding path program 10 times [2024-05-06 23:16:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:20,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 23:16:20,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:20,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 546730109, now seen corresponding path program 1 times [2024-05-06 23:16:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759347286] [2024-05-06 23:16:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:16:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759347286] [2024-05-06 23:16:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759347286] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:16:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305384175] [2024-05-06 23:16:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:16:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:20,958 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-06 23:16:20,976 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-06 23:16:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:21,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-06 23:16:21,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:16:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:21,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 23:16:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305384175] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 23:16:21,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 23:16:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-06 23:16:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4229327] [2024-05-06 23:16:21,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 23:16:21,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-06 23:16:21,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:16:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 23:16:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-06 23:16:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:21,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:16:21,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-06 23:16:21,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:21,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:21,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 23:16:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-05-06 23:16:21,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:21,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -872570179, now seen corresponding path program 2 times [2024-05-06 23:16:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203321199] [2024-05-06 23:16:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:21,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:16:21,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203321199] [2024-05-06 23:16:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203321199] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:16:21,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131526604] [2024-05-06 23:16:21,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 23:16:21,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:16:21,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:21,632 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-06 23:16:21,638 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-06 23:16:21,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 23:16:21,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 23:16:21,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-06 23:16:21,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:16:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:21,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 23:16:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131526604] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 23:16:21,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 23:16:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-06 23:16:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238648558] [2024-05-06 23:16:21,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 23:16:21,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-06 23:16:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:16:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-06 23:16:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-06 23:16:21,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:21,905 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:16:21,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.833333333333334) internal successors, (195), 18 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-06 23:16:21,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:21,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:21,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:22,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-06 23:16:22,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-05-06 23:16:22,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:22,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash 328881981, now seen corresponding path program 3 times [2024-05-06 23:16:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:22,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287720182] [2024-05-06 23:16:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:16:22,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287720182] [2024-05-06 23:16:22,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287720182] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:16:22,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225536590] [2024-05-06 23:16:22,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 23:16:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:16:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:22,603 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-06 23:16:22,605 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-06 23:16:22,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-06 23:16:22,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 23:16:22,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-06 23:16:22,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:16:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:22,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 23:16:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225536590] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:16:22,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 23:16:22,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2024-05-06 23:16:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543219103] [2024-05-06 23:16:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:16:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-06 23:16:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:16:22,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-06 23:16:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2024-05-06 23:16:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:22,981 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:16:22,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.764705882352942) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 23:16:22,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:22,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:22,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:22,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:23,169 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-06 23:16:23,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:16:23,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:23,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1806159523, now seen corresponding path program 1 times [2024-05-06 23:16:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188095304] [2024-05-06 23:16:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:16:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188095304] [2024-05-06 23:16:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188095304] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:16:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021317649] [2024-05-06 23:16:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:16:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:23,667 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-06 23:16:23,688 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-06 23:16:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:23,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-06 23:16:23,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:16:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-06 23:16:23,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 23:16:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021317649] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:16:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 23:16:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2024-05-06 23:16:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864541797] [2024-05-06 23:16:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:16:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-06 23:16:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:16:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-06 23:16:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-05-06 23:16:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:23,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:16:23,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 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-06 23:16:23,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:23,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:23,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:23,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:23,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:24,134 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-06 23:16:24,334 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,SelfDestructingSolverStorable26 [2024-05-06 23:16:24,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:24,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1433795, now seen corresponding path program 1 times [2024-05-06 23:16:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179842336] [2024-05-06 23:16:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:24,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:16:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179842336] [2024-05-06 23:16:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179842336] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:16:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33976917] [2024-05-06 23:16:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:16:24,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:16:24,574 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-06 23:16:24,585 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-06 23:16:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:16:24,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-06 23:16:24,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:16:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:24,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 23:16:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:16:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33976917] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 23:16:25,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 23:16:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2024-05-06 23:16:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350771964] [2024-05-06 23:16:25,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 23:16:25,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-06 23:16:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:16:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-06 23:16:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2024-05-06 23:16:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:25,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:16:25,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.333333333333334) internal successors, (252), 27 states have internal predecessors, (252), 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-06 23:16:25,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:25,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:25,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:25,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:25,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:25,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:16:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:16:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 23:16:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 23:16:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-06 23:16:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-06 23:16:25,320 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-06 23:16:25,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-05-06 23:16:25,521 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 23:16:25,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:16:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1854083322, now seen corresponding path program 2 times [2024-05-06 23:16:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:16:25,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691824411] [2024-05-06 23:16:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:16:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:16:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:25,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:16:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:16:25,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 23:16:25,589 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 23:16:25,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-06 23:16:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-06 23:16:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-06 23:16:25,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-06 23:16:25,597 INFO L448 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2024-05-06 23:16:25,601 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 23:16:25,601 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 23:16:25,655 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2024-05-06 23:16:25,656 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2024-05-06 23:16:25,675 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2024-05-06 23:16:25,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:16:25 BasicIcfg [2024-05-06 23:16:25,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 23:16:25,693 INFO L158 Benchmark]: Toolchain (without parser) took 8215.55ms. Allocated memory was 271.6MB in the beginning and 362.8MB in the end (delta: 91.2MB). Free memory was 199.5MB in the beginning and 193.8MB in the end (delta: 5.7MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2024-05-06 23:16:25,693 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 23:16:25,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.11ms. Allocated memory is still 271.6MB. Free memory was 199.3MB in the beginning and 230.0MB in the end (delta: -30.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-06 23:16:25,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.15ms. Allocated memory is still 271.6MB. Free memory was 229.5MB in the beginning and 227.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 23:16:25,696 INFO L158 Benchmark]: Boogie Preprocessor took 32.57ms. Allocated memory is still 271.6MB. Free memory was 227.9MB in the beginning and 226.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 23:16:25,696 INFO L158 Benchmark]: RCFGBuilder took 408.68ms. Allocated memory is still 271.6MB. Free memory was 226.4MB in the beginning and 212.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-06 23:16:25,697 INFO L158 Benchmark]: TraceAbstraction took 7333.03ms. Allocated memory was 271.6MB in the beginning and 362.8MB in the end (delta: 91.2MB). Free memory was 210.6MB in the beginning and 193.8MB in the end (delta: 16.8MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. [2024-05-06 23:16:25,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 391.11ms. Allocated memory is still 271.6MB. Free memory was 199.3MB in the beginning and 230.0MB in the end (delta: -30.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.15ms. Allocated memory is still 271.6MB. Free memory was 229.5MB in the beginning and 227.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.57ms. Allocated memory is still 271.6MB. Free memory was 227.9MB in the beginning and 226.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 408.68ms. Allocated memory is still 271.6MB. Free memory was 226.4MB in the beginning and 212.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7333.03ms. Allocated memory was 271.6MB in the beginning and 362.8MB in the end (delta: 91.2MB). Free memory was 210.6MB in the beginning and 193.8MB in the end (delta: 16.8MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21606, independent: 19591, independent conditional: 13960, independent unconditional: 5631, dependent: 2015, dependent conditional: 1993, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19635, independent: 19591, independent conditional: 13960, independent unconditional: 5631, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19635, independent: 19591, independent conditional: 13960, independent unconditional: 5631, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19635, independent: 19591, independent conditional: 13960, independent unconditional: 5631, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19689, independent: 19591, independent conditional: 3289, independent unconditional: 16302, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19689, independent: 19591, independent conditional: 2197, independent unconditional: 17394, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19689, independent: 19591, independent conditional: 2197, independent unconditional: 17394, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 593, independent: 591, independent conditional: 4, independent unconditional: 587, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 593, independent: 591, independent conditional: 0, independent unconditional: 591, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19689, independent: 19000, independent conditional: 2193, independent unconditional: 16807, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 593, unknown conditional: 4, unknown unconditional: 589] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 591, Positive conditional cache size: 4, Positive unconditional cache size: 587, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1102, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19689, independent: 19591, independent conditional: 3289, independent unconditional: 16302, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19689, independent: 19591, independent conditional: 2197, independent unconditional: 17394, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19689, independent: 19591, independent conditional: 2197, independent unconditional: 17394, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 593, independent: 591, independent conditional: 4, independent unconditional: 587, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 593, independent: 591, independent conditional: 0, independent unconditional: 591, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19689, independent: 19000, independent conditional: 2193, independent unconditional: 16807, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 593, unknown conditional: 4, unknown unconditional: 589] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 591, Positive conditional cache size: 4, Positive unconditional cache size: 587, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1102 ], Independence queries for same thread: 1971 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; VAL [i=0, j=0] [L685] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L702] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L703] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L713] 0 pthread_t id1, id2; VAL [\old(argc)=234, argc=234, argv={235:236}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=234, argc=234, argv={235:236}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=234, argc=234, argv={235:236}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=234, arg={0:0}, argc=234, argv={235:236}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=234, arg={0:0}, arg={0:0}, arg={0:0}, argc=234, argv={235:236}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=0, q=1, x=0] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=1, q=3, x=2] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=2, q=4, x=3] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=3, q=5, x=4] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND FALSE 1 !(p < 5) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L692] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L695] COND FALSE 2 !(q < 5) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L700] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=13, p=5, prev=5, q=5, x=5] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=13, p=5, prev=8, q=5, x=5] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=5] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=6] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=6] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=21, p=5, prev=8, q=5, x=6] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=21, p=5, prev=13, q=5, x=6] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=21, p=5, prev=13, q=5, x=6] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=21, p=5, prev=13, q=5, x=7] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=21, p=5, prev=13, q=5, x=7] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=34, p=5, prev=13, q=5, x=7] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=34, p=5, prev=21, q=5, x=7] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=34, p=5, prev=21, q=5, x=7] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=34, p=5, prev=21, q=5, x=8] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=34, p=5, prev=21, q=5, x=8] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=55, p=5, prev=21, q=5, x=8] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=55, p=5, prev=34, q=5, x=8] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=55, p=5, prev=34, q=5, x=8] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=55, p=5, prev=34, q=5, x=9] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=55, p=5, prev=34, q=5, x=9] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=89, p=5, prev=34, q=5, x=9] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=89, p=5, prev=55, q=5, x=9] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=89, p=5, prev=55, q=5, x=9] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=89, p=5, prev=55, q=5, x=10] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=89, p=5, prev=55, q=5, x=10] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=144, p=5, prev=55, q=5, x=10] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=144, p=5, prev=89, q=5, x=10] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=144, p=5, prev=89, q=5, x=10] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=144, p=5, prev=89, q=5, x=11] [L705] COND TRUE 0 x < 12 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=144, p=5, prev=89, q=5, x=11] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=233, p=5, prev=89, q=5, x=11] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=233, p=5, prev=144, q=5, x=11] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=89, j=144, next=233, p=5, prev=144, q=5, x=11] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L705] COND FALSE 0 !(x < 12) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L710] 0 return prev; VAL [\result=144, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); VAL [\old(argc)=234, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=234, argv={235:236}, correct=144, cur=233, i=89, id1={5:0}, id2={3:0}, j=144, next=233, p=5, prev=144, q=5, x=12] [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=234, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=234, argv={235:236}, assert_cond=0, correct=144, cur=233, i=89, id1={5:0}, id2={3:0}, j=144, next=233, p=5, prev=144, q=5, x=12] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, expression=0, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, expression=0, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 3.0s, 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: 105, 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.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1676 NumberOfCodeBlocks, 1676 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1823 ConstructedInterpolants, 0 QuantifiedInterpolants, 3975 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 783/2643 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: 1.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 22, ConditionalCommutativityTraceChecks: 22, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 23:16:25,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 23:16:25,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...