/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread-theta/unwind3-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 13:40:41,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 13:40:41,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 13:40:41,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 13:40:41,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 13:40:41,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 13:40:41,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 13:40:41,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 13:40:41,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 13:40:41,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 13:40:41,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 13:40:41,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 13:40:41,663 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 13:40:41,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 13:40:41,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:40:41,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:41,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:41,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 13:40:41,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 13:40:41,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 13:40:41,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 13:40:41,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 13:40:41,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 13:40:41,897 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 13:40:41,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-14 13:40:43,131 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7a27198/fbd38cb170ac45049803593e1efaf99b/FLAGf94147965 [2025-04-14 13:40:43,386 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 13:40:43,387 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-14 13:40:43,399 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7a27198/fbd38cb170ac45049803593e1efaf99b/FLAGf94147965 [2025-04-14 13:40:44,132 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7a27198/fbd38cb170ac45049803593e1efaf99b [2025-04-14 13:40:44,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 13:40:44,135 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 13:40:44,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 13:40:44,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 13:40:44,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 13:40:44,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f163365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44, skipping insertion in model container [2025-04-14 13:40:44,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 13:40:44,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-100.i[33026,33039] [2025-04-14 13:40:44,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:40:44,443 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 13:40:44,500 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-100.i[33026,33039] [2025-04-14 13:40:44,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:40:44,527 INFO L204 MainTranslator]: Completed translation [2025-04-14 13:40:44,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44 WrapperNode [2025-04-14 13:40:44,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 13:40:44,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 13:40:44,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 13:40:44,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 13:40:44,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,565 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-14 13:40:44,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 13:40:44,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 13:40:44,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 13:40:44,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 13:40:44,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 13:40:44,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 13:40:44,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 13:40:44,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 13:40:44,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (1/1) ... [2025-04-14 13:40:44,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:44,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 13:40:44,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 13:40:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 13:40:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 13:40:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 13:40:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 13:40:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 13:40:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 13:40:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 13:40:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 13:40:44,633 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 13:40:44,706 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 13:40:44,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 13:40:44,780 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 13:40:44,780 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 13:40:44,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 13:40:44,837 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 13:40:44,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:40:44 BoogieIcfgContainer [2025-04-14 13:40:44,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 13:40:44,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 13:40:44,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 13:40:44,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 13:40:44,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:40:44" (1/3) ... [2025-04-14 13:40:44,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb44668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:40:44, skipping insertion in model container [2025-04-14 13:40:44,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:44" (2/3) ... [2025-04-14 13:40:44,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb44668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:40:44, skipping insertion in model container [2025-04-14 13:40:44,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:40:44" (3/3) ... [2025-04-14 13:40:44,847 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-04-14 13:40:44,856 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 13:40:44,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 20 locations, 20 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 13:40:44,858 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 13:40:44,890 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:44,920 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:44,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 13:40:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:44,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 13:40:44,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 13:40:44,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:45,001 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2025-04-14 13:40:45,009 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:45,009 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:45,065 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:45,065 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:45,066 INFO L139 ounterexampleChecker]: Examining path program with hash -1850587884, occurence #1 [2025-04-14 13:40:45,066 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:45,066 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:45,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1485759046, now seen corresponding path program 1 times [2025-04-14 13:40:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:45,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099521763] [2025-04-14 13:40:45,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:45,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 13:40:45,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 13:40:45,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:45,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:45,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099521763] [2025-04-14 13:40:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099521763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:40:45,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000615122] [2025-04-14 13:40:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:45,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:40:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:45,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:40:45,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:40:45,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,312 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:45,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-04-14 13:40:45,313 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:45,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 13:40:45,438 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:45,438 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:45,438 INFO L139 ounterexampleChecker]: Examining path program with hash 1737353845, occurence #1 [2025-04-14 13:40:45,438 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:45,438 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:45,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -236137002, now seen corresponding path program 1 times [2025-04-14 13:40:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:45,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014739241] [2025-04-14 13:40:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:45,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:40:45,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:40:45,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:45,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014739241] [2025-04-14 13:40:45,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014739241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:45,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:45,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:40:45,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825712343] [2025-04-14 13:40:45,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:45,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:40:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:45,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:40:45,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:40:45,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,606 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:45,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-04-14 13:40:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:45,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:45,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:45,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 13:40:45,645 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:45,645 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:45,646 INFO L139 ounterexampleChecker]: Examining path program with hash 1737353845, occurence #2 [2025-04-14 13:40:45,646 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:45,646 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:40:45,646 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:40:45,646 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:45,646 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:45,646 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 13:40:45,646 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:45,646 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:45,646 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:45,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1269656892, now seen corresponding path program 1 times [2025-04-14 13:40:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:45,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012058444] [2025-04-14 13:40:45,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:45,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:45,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:45,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:45,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012058444] [2025-04-14 13:40:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012058444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:45,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:45,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:40:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454575853] [2025-04-14 13:40:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:45,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:40:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:45,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:40:45,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:40:45,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,709 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:45,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-14 13:40:45,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:45,710 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:45,710 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:45,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:45,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:45,791 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:45,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 13:40:45,812 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-14 13:40:45,815 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was SAFE (1/2) [2025-04-14 13:40:45,818 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:45,819 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:45,819 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:40:45,819 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:45,819 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:40:45,823 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:40:45,823 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:45,823 INFO L139 ounterexampleChecker]: Examining path program with hash -990531628, occurence #1 [2025-04-14 13:40:45,823 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:45,823 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:45,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash 324812989, now seen corresponding path program 1 times [2025-04-14 13:40:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:45,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219752870] [2025-04-14 13:40:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:45,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 13:40:45,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 13:40:45,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:45,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:45,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 13:40:45,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 13:40:45,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:45,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:45,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:45,858 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:45,858 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:40:45,858 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:40:45,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 13:40:45,859 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:40:45,859 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2025-04-14 13:40:45,860 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:40:45,860 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 13:40:45,874 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:45,875 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:45,882 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:45,882 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:40:45,882 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:45,882 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:40:46,110 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:40:46,111 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:46,111 INFO L139 ounterexampleChecker]: Examining path program with hash -430321656, occurence #1 [2025-04-14 13:40:46,111 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:46,111 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:46,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1551248072, now seen corresponding path program 1 times [2025-04-14 13:40:46,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:46,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471082890] [2025-04-14 13:40:46,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:46,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:46,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:46,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:46,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:46,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:46,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:46,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:46,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:46,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:46,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:46,141 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:46,141 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:40:46,141 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:40:46,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 13:40:46,142 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:40:46,142 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/3) [2025-04-14 13:40:46,142 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:40:46,142 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 13:40:46,162 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:46,166 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:46,176 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:46,176 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of3ForFork0 ======== [2025-04-14 13:40:46,176 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:46,176 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:46,905 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:46,906 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:46,906 INFO L320 ceAbstractionStarter]: Result for error location f2Thread3of3ForFork0 was SAFE (1/4) [2025-04-14 13:40:46,907 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:46,908 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:46,908 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:40:46,910 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:46,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:40:46,918 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:40:46,918 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:46,918 INFO L139 ounterexampleChecker]: Examining path program with hash -1597899317, occurence #1 [2025-04-14 13:40:46,918 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:46,919 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:46,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -570622774, now seen corresponding path program 1 times [2025-04-14 13:40:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:46,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079250381] [2025-04-14 13:40:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:46,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:40:46,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:46,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:46,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:46,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:46,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:40:46,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:46,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:46,943 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:46,943 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:40:46,943 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:40:46,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 13:40:46,944 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:40:46,944 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/4) [2025-04-14 13:40:46,944 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:40:46,944 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-14 13:40:46,961 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:46,963 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:46,977 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:46,977 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of4ForFork0 ======== [2025-04-14 13:40:46,978 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:46,978 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:48,065 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:48,066 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:48,067 INFO L320 ceAbstractionStarter]: Result for error location f2Thread3of4ForFork0 was SAFE (1/5) [2025-04-14 13:40:48,068 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,068 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:48,068 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of4ForFork0 ======== [2025-04-14 13:40:48,069 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,069 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:48,268 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:48,271 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:48,272 INFO L320 ceAbstractionStarter]: Result for error location f2Thread4of4ForFork0 was SAFE (2/5) [2025-04-14 13:40:48,275 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,276 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:48,276 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of4ForFork0 ======== [2025-04-14 13:40:48,276 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,276 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:48,469 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:48,471 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:48,471 INFO L320 ceAbstractionStarter]: Result for error location f2Thread2of4ForFork0 was SAFE (3/5) [2025-04-14 13:40:48,473 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,473 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:48,473 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of4ForFork0 ======== [2025-04-14 13:40:48,474 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,474 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:48,476 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:48,476 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,476 INFO L139 ounterexampleChecker]: Examining path program with hash -1663312185, occurence #1 [2025-04-14 13:40:48,476 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:48,476 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1066444325, now seen corresponding path program 1 times [2025-04-14 13:40:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014922883] [2025-04-14 13:40:48,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 13:40:48,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 13:40:48,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014922883] [2025-04-14 13:40:48,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014922883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:40:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999804010] [2025-04-14 13:40:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:40:48,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:40:48,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:40:48,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,503 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-04-14 13:40:48,503 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 13:40:48,523 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:48,523 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,523 INFO L139 ounterexampleChecker]: Examining path program with hash -1127918317, occurence #1 [2025-04-14 13:40:48,523 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:48,523 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1653421229, now seen corresponding path program 1 times [2025-04-14 13:40:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298462653] [2025-04-14 13:40:48,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:40:48,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:40:48,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:48,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298462653] [2025-04-14 13:40:48,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298462653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:40:48,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163238388] [2025-04-14 13:40:48,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:40:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:40:48,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:40:48,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,596 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-04-14 13:40:48,596 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,596 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 13:40:48,625 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:48,625 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,625 INFO L139 ounterexampleChecker]: Examining path program with hash -1127918317, occurence #2 [2025-04-14 13:40:48,626 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:48,626 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:40:48,626 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:40:48,626 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:48,626 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:48,626 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 13:40:48,626 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:48,626 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:48,626 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 283519168, now seen corresponding path program 1 times [2025-04-14 13:40:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911711996] [2025-04-14 13:40:48,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:48,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:48,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911711996] [2025-04-14 13:40:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911711996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:40:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447300634] [2025-04-14 13:40:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:40:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:40:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:40:48,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,676 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-14 13:40:48,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 13:40:48,717 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:48,717 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,717 INFO L139 ounterexampleChecker]: Examining path program with hash -585608852, occurence #1 [2025-04-14 13:40:48,717 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:48,717 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -771685754, now seen corresponding path program 1 times [2025-04-14 13:40:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439764791] [2025-04-14 13:40:48,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:40:48,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439764791] [2025-04-14 13:40:48,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439764791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:40:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531839843] [2025-04-14 13:40:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:40:48,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,783 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-14 13:40:48,783 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,783 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,783 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,783 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:48,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 13:40:48,844 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:48,844 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,844 INFO L139 ounterexampleChecker]: Examining path program with hash -468565348, occurence #1 [2025-04-14 13:40:48,844 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:48,844 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1962323446, now seen corresponding path program 1 times [2025-04-14 13:40:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843955277] [2025-04-14 13:40:48,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 13:40:48,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 13:40:48,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843955277] [2025-04-14 13:40:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843955277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 13:40:48,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588412643] [2025-04-14 13:40:48,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 13:40:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 13:40:48,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:40:48,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,931 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2025-04-14 13:40:48,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:48,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:49,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:49,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:49,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:49,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:49,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:40:49,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 13:40:49,011 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:49,011 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:49,011 INFO L139 ounterexampleChecker]: Examining path program with hash 1793186048, occurence #1 [2025-04-14 13:40:49,011 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:49,011 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:49,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1379094732, now seen corresponding path program 1 times [2025-04-14 13:40:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:49,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048506983] [2025-04-14 13:40:49,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:49,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:40:49,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:40:49,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:49,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:49,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048506983] [2025-04-14 13:40:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048506983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:49,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 13:40:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176227278] [2025-04-14 13:40:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:49,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:40:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:49,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:40:49,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:40:49,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:49,119 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:49,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-14 13:40:49,119 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:49,119 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:49,119 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:49,119 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:49,119 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:40:49,119 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:49,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:49,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:49,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:49,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:49,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:40:49,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:40:49,386 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:49,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 13:40:49,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-14 13:40:49,387 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of4ForFork0 was SAFE (4/5) [2025-04-14 13:40:49,388 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:49,388 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:49,388 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:40:49,388 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:49,388 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:40:49,394 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:40:49,394 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:49,394 INFO L139 ounterexampleChecker]: Examining path program with hash 828329546, occurence #1 [2025-04-14 13:40:49,394 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:49,394 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:49,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1821896785, now seen corresponding path program 1 times [2025-04-14 13:40:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:49,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486314335] [2025-04-14 13:40:49,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:49,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 13:40:49,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 13:40:49,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:49,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:49,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 13:40:49,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 13:40:49,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:49,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:49,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:49,423 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:49,423 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:40:49,423 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:40:49,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 13:40:49,425 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:40:49,425 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (5/5) [2025-04-14 13:40:49,425 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:40:49,425 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-14 13:40:49,451 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:49,452 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:49,467 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:49,467 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of5ForFork0 ======== [2025-04-14 13:40:49,467 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:49,467 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:51,438 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:51,439 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:51,439 INFO L320 ceAbstractionStarter]: Result for error location f2Thread2of5ForFork0 was SAFE (1/6) [2025-04-14 13:40:51,440 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:51,440 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:51,440 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of5ForFork0 ======== [2025-04-14 13:40:51,441 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:51,441 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:52,285 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:52,286 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:52,286 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of5ForFork0 was SAFE (2/6) [2025-04-14 13:40:52,288 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:52,288 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:52,288 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:40:52,289 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:52,289 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:40:52,294 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:40:52,295 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:52,295 INFO L139 ounterexampleChecker]: Examining path program with hash 1181857289, occurence #1 [2025-04-14 13:40:52,295 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:52,295 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:52,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -688143317, now seen corresponding path program 1 times [2025-04-14 13:40:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:52,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638925561] [2025-04-14 13:40:52,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:52,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:40:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:40:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:52,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:52,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:52,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:40:52,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:40:52,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:52,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:52,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:52,321 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:52,321 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:40:52,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:40:52,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 13:40:52,322 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:40:52,322 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (3/6) [2025-04-14 13:40:52,323 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:40:52,323 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-14 13:40:52,347 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:52,348 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:52,364 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:52,364 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of6ForFork0 ======== [2025-04-14 13:40:52,364 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:52,365 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:57,473 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:57,474 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:40:57,474 INFO L320 ceAbstractionStarter]: Result for error location f2Thread2of6ForFork0 was SAFE (1/7) [2025-04-14 13:40:57,475 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:57,475 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:57,475 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of6ForFork0 ======== [2025-04-14 13:40:57,476 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:57,476 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:41:01,195 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:01,196 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:41:01,196 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of6ForFork0 was SAFE (2/7) [2025-04-14 13:41:01,197 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:01,197 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:01,197 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of6ForFork0 ======== [2025-04-14 13:41:01,198 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:01,198 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:41:04,899 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:04,900 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:41:04,900 INFO L320 ceAbstractionStarter]: Result for error location f2Thread4of6ForFork0 was SAFE (3/7) [2025-04-14 13:41:04,901 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:04,902 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:04,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of6ForFork0 ======== [2025-04-14 13:41:04,902 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:04,902 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:41:04,904 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:04,904 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:04,904 INFO L139 ounterexampleChecker]: Examining path program with hash -28042435, occurence #1 [2025-04-14 13:41:04,904 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:04,904 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:04,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -675539007, now seen corresponding path program 1 times [2025-04-14 13:41:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:04,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198737092] [2025-04-14 13:41:04,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:04,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 13:41:04,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 13:41:04,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:04,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:41:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:04,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198737092] [2025-04-14 13:41:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198737092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:04,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:41:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454211338] [2025-04-14 13:41:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:04,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:41:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:04,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:41:04,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:41:04,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:04,927 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:04,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-04-14 13:41:04,927 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:04,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:04,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 13:41:04,945 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:04,945 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:04,945 INFO L139 ounterexampleChecker]: Examining path program with hash 536910534, occurence #1 [2025-04-14 13:41:04,945 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:04,945 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:04,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1103387626, now seen corresponding path program 1 times [2025-04-14 13:41:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:04,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688513563] [2025-04-14 13:41:04,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:41:04,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:41:04,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:04,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:41:04,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:04,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688513563] [2025-04-14 13:41:04,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688513563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:04,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:04,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:41:04,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407203554] [2025-04-14 13:41:04,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:04,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:41:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:04,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:41:04,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:41:04,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:04,988 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:04,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-04-14 13:41:04,988 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:04,988 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 13:41:05,018 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:05,018 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:05,018 INFO L139 ounterexampleChecker]: Examining path program with hash 536910534, occurence #2 [2025-04-14 13:41:05,018 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:41:05,018 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:41:05,018 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:41:05,018 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:41:05,018 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:41:05,018 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 13:41:05,018 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:41:05,018 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:41:05,018 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:05,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash -154751604, now seen corresponding path program 1 times [2025-04-14 13:41:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:05,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60940794] [2025-04-14 13:41:05,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:05,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:41:05,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:41:05,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:05,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:41:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:05,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60940794] [2025-04-14 13:41:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60940794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:05,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:41:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562100492] [2025-04-14 13:41:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:41:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:41:05,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:41:05,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,055 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-14 13:41:05,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 13:41:05,089 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:05,089 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:05,089 INFO L139 ounterexampleChecker]: Examining path program with hash -342286852, occurence #1 [2025-04-14 13:41:05,089 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:05,089 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:05,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash -941851775, now seen corresponding path program 1 times [2025-04-14 13:41:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:05,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586321401] [2025-04-14 13:41:05,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:05,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:41:05,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:41:05,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:05,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:41:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:05,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586321401] [2025-04-14 13:41:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586321401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:41:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073157614] [2025-04-14 13:41:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:41:05,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:41:05,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:41:05,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,142 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-14 13:41:05,142 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,142 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,142 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,142 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 13:41:05,190 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:05,190 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:05,190 INFO L139 ounterexampleChecker]: Examining path program with hash -239566021, occurence #1 [2025-04-14 13:41:05,190 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:05,190 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:05,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1010797757, now seen corresponding path program 1 times [2025-04-14 13:41:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:05,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030902534] [2025-04-14 13:41:05,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:05,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:05,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 13:41:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 13:41:05,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:05,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:41:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:05,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030902534] [2025-04-14 13:41:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030902534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:05,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 13:41:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986089996] [2025-04-14 13:41:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 13:41:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 13:41:05,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:41:05,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,255 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2025-04-14 13:41:05,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:05,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 13:41:05,324 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:05,324 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:05,324 INFO L139 ounterexampleChecker]: Examining path program with hash 392547079, occurence #1 [2025-04-14 13:41:05,324 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:05,324 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:05,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -745795584, now seen corresponding path program 1 times [2025-04-14 13:41:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:05,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988857153] [2025-04-14 13:41:05,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:05,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:41:05,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:41:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:05,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:41:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:05,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988857153] [2025-04-14 13:41:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988857153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 13:41:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762401633] [2025-04-14 13:41:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:41:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:41:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:41:05,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,411 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-14 13:41:05,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:05,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:05,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:41:05,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 13:41:05,508 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:05,508 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:05,508 INFO L139 ounterexampleChecker]: Examining path program with hash 1913220226, occurence #1 [2025-04-14 13:41:05,508 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:05,508 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:05,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 193869633, now seen corresponding path program 1 times [2025-04-14 13:41:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:05,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289733838] [2025-04-14 13:41:05,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:05,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 13:41:05,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 13:41:05,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:05,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:41:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:05,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289733838] [2025-04-14 13:41:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289733838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:41:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101435478] [2025-04-14 13:41:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 13:41:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 13:41:05,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-14 13:41:05,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,591 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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) [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:41:05,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:05,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:41:05,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:05,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 13:41:05,690 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:05,690 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:05,690 INFO L139 ounterexampleChecker]: Examining path program with hash 353860999, occurence #1 [2025-04-14 13:41:05,690 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:05,690 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:05,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash -192110793, now seen corresponding path program 1 times [2025-04-14 13:41:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:05,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656484163] [2025-04-14 13:41:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:05,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:41:05,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:41:05,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:05,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:41:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:05,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656484163] [2025-04-14 13:41:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656484163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 13:41:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483366157] [2025-04-14 13:41:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 13:41:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 13:41:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-14 13:41:05,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,782 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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) [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:05,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:08,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:41:08,995 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:08,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 13:41:08,995 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 13:41:08,995 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of6ForFork0 was SAFE (4/7) [2025-04-14 13:41:09,001 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:09,001 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:09,001 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of6ForFork0 ======== [2025-04-14 13:41:09,002 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:09,002 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:41:12,645 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:12,646 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:41:12,646 INFO L320 ceAbstractionStarter]: Result for error location f2Thread6of6ForFork0 was SAFE (5/7) [2025-04-14 13:41:12,647 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:12,647 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:12,647 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:41:12,647 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:12,647 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:41:12,652 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:41:12,652 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:12,652 INFO L139 ounterexampleChecker]: Examining path program with hash -399044177, occurence #1 [2025-04-14 13:41:12,652 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:41:12,652 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:12,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash -368456372, now seen corresponding path program 1 times [2025-04-14 13:41:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:12,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051018621] [2025-04-14 13:41:12,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:12,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 13:41:12,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 13:41:12,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:12,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:41:12,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:41:12,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 13:41:12,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 13:41:12,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:12,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:41:12,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:41:12,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:41:12,672 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:41:12,672 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:41:12,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 13:41:12,672 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:41:12,672 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (6/7) [2025-04-14 13:41:12,673 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:41:12,673 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-14 13:41:12,707 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:41:12,709 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:12,724 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:12,724 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of7ForFork0 ======== [2025-04-14 13:41:12,724 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:12,724 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:41:32,087 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:32,088 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:41:32,088 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of7ForFork0 was SAFE (1/8) [2025-04-14 13:41:32,091 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:32,091 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:32,091 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of7ForFork0 ======== [2025-04-14 13:41:32,092 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:32,092 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:41:50,326 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:50,327 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:41:50,327 INFO L320 ceAbstractionStarter]: Result for error location f2Thread3of7ForFork0 was SAFE (2/8) [2025-04-14 13:41:50,328 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:50,329 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:41:50,329 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of7ForFork0 ======== [2025-04-14 13:41:50,329 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:41:50,329 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:42:08,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:42:08,457 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:42:08,458 INFO L320 ceAbstractionStarter]: Result for error location f2Thread7of7ForFork0 was SAFE (3/8) [2025-04-14 13:42:08,459 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:42:08,459 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:42:08,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of7ForFork0 ======== [2025-04-14 13:42:08,459 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:42:08,459 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:42:26,152 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:42:26,153 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:42:26,153 INFO L320 ceAbstractionStarter]: Result for error location f2Thread6of7ForFork0 was SAFE (4/8) [2025-04-14 13:42:26,154 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:42:26,154 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:42:26,154 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of7ForFork0 ======== [2025-04-14 13:42:26,154 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:42:26,154 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:42:26,156 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,156 INFO L139 ounterexampleChecker]: Examining path program with hash -398435544, occurence #1 [2025-04-14 13:42:26,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1437873116, now seen corresponding path program 1 times [2025-04-14 13:42:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493405096] [2025-04-14 13:42:26,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 13:42:26,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 13:42:26,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:42:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493405096] [2025-04-14 13:42:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493405096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:42:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290451295] [2025-04-14 13:42:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:42:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:42:26,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:42:26,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,175 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-04-14 13:42:26,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 13:42:26,190 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,190 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,190 INFO L139 ounterexampleChecker]: Examining path program with hash -1185595029, occurence #1 [2025-04-14 13:42:26,190 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,190 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2140392420, now seen corresponding path program 1 times [2025-04-14 13:42:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569486625] [2025-04-14 13:42:26,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:42:26,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:42:26,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:42:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569486625] [2025-04-14 13:42:26,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569486625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:42:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183495835] [2025-04-14 13:42:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:42:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:42:26,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:42:26,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,226 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-04-14 13:42:26,226 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,226 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 13:42:26,250 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,250 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,250 INFO L139 ounterexampleChecker]: Examining path program with hash -1185595029, occurence #2 [2025-04-14 13:42:26,250 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:42:26,250 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:42:26,250 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:42:26,250 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:42:26,250 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:42:26,250 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 13:42:26,250 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:42:26,250 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:42:26,250 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1927684683, now seen corresponding path program 1 times [2025-04-14 13:42:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960270269] [2025-04-14 13:42:26,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:42:26,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:42:26,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:26,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960270269] [2025-04-14 13:42:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960270269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:42:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850022655] [2025-04-14 13:42:26,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:42:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:42:26,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:42:26,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,276 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-14 13:42:26,276 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,276 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,276 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 13:42:26,306 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,306 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,306 INFO L139 ounterexampleChecker]: Examining path program with hash -1360308230, occurence #1 [2025-04-14 13:42:26,306 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,306 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash -453942148, now seen corresponding path program 1 times [2025-04-14 13:42:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221457373] [2025-04-14 13:42:26,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:42:26,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:42:26,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221457373] [2025-04-14 13:42:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221457373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:42:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208365567] [2025-04-14 13:42:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:42:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:42:26,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:42:26,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,340 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-14 13:42:26,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 13:42:26,386 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,386 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,386 INFO L139 ounterexampleChecker]: Examining path program with hash 1631982807, occurence #1 [2025-04-14 13:42:26,386 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,386 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 444919672, now seen corresponding path program 1 times [2025-04-14 13:42:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431540132] [2025-04-14 13:42:26,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 13:42:26,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 13:42:26,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431540132] [2025-04-14 13:42:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431540132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 13:42:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317845025] [2025-04-14 13:42:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 13:42:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 13:42:26,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:42:26,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,430 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2025-04-14 13:42:26,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 13:42:26,490 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,490 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,490 INFO L139 ounterexampleChecker]: Examining path program with hash -440941, occurence #1 [2025-04-14 13:42:26,490 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,490 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash 5175352, now seen corresponding path program 1 times [2025-04-14 13:42:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157096489] [2025-04-14 13:42:26,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:42:26,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:42:26,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157096489] [2025-04-14 13:42:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157096489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 13:42:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428768805] [2025-04-14 13:42:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:42:26,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:42:26,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:42:26,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,555 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-14 13:42:26,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:26,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 13:42:26,634 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,634 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,634 INFO L139 ounterexampleChecker]: Examining path program with hash 1917839007, occurence #1 [2025-04-14 13:42:26,634 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,634 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1315160063, now seen corresponding path program 1 times [2025-04-14 13:42:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228569613] [2025-04-14 13:42:26,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 13:42:26,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 13:42:26,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:26,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228569613] [2025-04-14 13:42:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228569613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:42:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998115859] [2025-04-14 13:42:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 13:42:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 13:42:26,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-14 13:42:26,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,709 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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) [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:26,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:26,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:42:26,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 13:42:26,801 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,801 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,801 INFO L139 ounterexampleChecker]: Examining path program with hash -282133309, occurence #1 [2025-04-14 13:42:26,801 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,801 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1423685168, now seen corresponding path program 1 times [2025-04-14 13:42:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392233344] [2025-04-14 13:42:26,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:42:26,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:42:26,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:26,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392233344] [2025-04-14 13:42:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392233344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 13:42:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650355498] [2025-04-14 13:42:26,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:26,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 13:42:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:26,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 13:42:26,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-14 13:42:26,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,882 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:26,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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) [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:42:26,882 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:42:26,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:42:26,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 13:42:26,993 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:42:26,993 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:42:26,993 INFO L139 ounterexampleChecker]: Examining path program with hash 1659266353, occurence #1 [2025-04-14 13:42:26,993 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:42:26,993 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:42:26,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:42:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2125649183, now seen corresponding path program 1 times [2025-04-14 13:42:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:42:26,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564538505] [2025-04-14 13:42:26,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:42:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:42:26,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-14 13:42:27,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-14 13:42:27,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:42:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:42:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:42:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:42:27,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564538505] [2025-04-14 13:42:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564538505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:42:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:42:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 13:42:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620649612] [2025-04-14 13:42:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:42:27,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 13:42:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:42:27,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 13:42:27,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-04-14 13:42:27,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:27,085 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:42:27,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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) [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:42:27,085 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:42:43,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:42:43,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 13:42:43,577 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:42:43,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 13:42:43,577 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 13:42:43,577 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of7ForFork0 was SAFE (5/8) [2025-04-14 13:42:43,578 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:42:43,579 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:42:43,579 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of7ForFork0 ======== [2025-04-14 13:42:43,579 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:42:43,579 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:43:01,233 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:43:01,235 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:43:01,235 INFO L320 ceAbstractionStarter]: Result for error location f2Thread4of7ForFork0 was SAFE (6/8) [2025-04-14 13:43:01,236 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:43:01,236 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:43:01,236 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:43:01,236 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:43:01,236 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 13:43:01,243 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:43:01,243 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:01,243 INFO L139 ounterexampleChecker]: Examining path program with hash -636617610, occurence #1 [2025-04-14 13:43:01,243 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:01,243 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:01,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1110532120, now seen corresponding path program 1 times [2025-04-14 13:43:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:01,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466214816] [2025-04-14 13:43:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:01,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:43:01,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:43:01,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:43:01,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:43:01,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:43:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:43:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:43:01,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:43:01,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:43:01,263 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 13:43:01,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 13:43:01,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 13:43:01,263 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:43:01,263 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (7/8) [2025-04-14 13:43:01,264 WARN L247 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:43:01,264 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-04-14 13:43:01,291 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:43:01,293 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:43:01,312 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:43:01,312 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of8ForFork0 ======== [2025-04-14 13:43:01,312 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:43:01,312 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:43:01,961 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:01,961 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:01,961 INFO L139 ounterexampleChecker]: Examining path program with hash -643364063, occurence #1 [2025-04-14 13:43:01,961 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:01,962 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:01,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 807095911, now seen corresponding path program 1 times [2025-04-14 13:43:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:01,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055782917] [2025-04-14 13:43:01,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:01,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 13:43:01,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 13:43:01,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:01,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:43:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:01,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055782917] [2025-04-14 13:43:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055782917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:43:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908851251] [2025-04-14 13:43:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:01,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:43:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:01,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:43:01,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:43:01,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:01,983 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:01,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-04-14 13:43:01,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-14 13:43:02,203 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:02,203 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:02,203 INFO L139 ounterexampleChecker]: Examining path program with hash -1935934639, occurence #1 [2025-04-14 13:43:02,203 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:02,203 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:02,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1232926155, now seen corresponding path program 1 times [2025-04-14 13:43:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:02,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142517565] [2025-04-14 13:43:02,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:02,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:43:02,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:43:02,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:43:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:02,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142517565] [2025-04-14 13:43:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142517565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:43:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274056568] [2025-04-14 13:43:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:02,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:43:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:02,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:43:02,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:43:02,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,234 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:02,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-04-14 13:43:02,234 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,234 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 13:43:02,260 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:02,260 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:02,260 INFO L139 ounterexampleChecker]: Examining path program with hash -1935934639, occurence #2 [2025-04-14 13:43:02,260 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:43:02,260 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:43:02,260 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:43:02,260 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:43:02,260 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:43:02,260 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 13:43:02,260 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:43:02,260 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:43:02,260 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:02,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash 433966424, now seen corresponding path program 1 times [2025-04-14 13:43:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:02,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843856289] [2025-04-14 13:43:02,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:02,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:43:02,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:43:02,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:02,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:02,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843856289] [2025-04-14 13:43:02,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843856289] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:02,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:02,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:43:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167666645] [2025-04-14 13:43:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:02,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:43:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:02,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:43:02,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:43:02,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,284 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:02,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-14 13:43:02,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 13:43:02,420 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:02,420 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:02,420 INFO L139 ounterexampleChecker]: Examining path program with hash 2081389588, occurence #1 [2025-04-14 13:43:02,421 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:02,421 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:02,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2111053009, now seen corresponding path program 1 times [2025-04-14 13:43:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:02,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292999977] [2025-04-14 13:43:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:02,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:43:02,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:43:02,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:02,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:02,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292999977] [2025-04-14 13:43:02,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292999977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:02,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:43:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788044033] [2025-04-14 13:43:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:02,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:43:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:02,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:43:02,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:43:02,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,452 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:02,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-14 13:43:02,452 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,452 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,452 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,452 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:02,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 13:43:02,589 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:02,589 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:02,589 INFO L139 ounterexampleChecker]: Examining path program with hash -469113347, occurence #1 [2025-04-14 13:43:02,589 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:02,589 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:02,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1530509502, now seen corresponding path program 1 times [2025-04-14 13:43:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:02,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242777014] [2025-04-14 13:43:02,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 13:43:02,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 13:43:02,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:02,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:02,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242777014] [2025-04-14 13:43:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242777014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:02,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:02,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 13:43:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071247668] [2025-04-14 13:43:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:02,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 13:43:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:02,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 13:43:02,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:43:02,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,629 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:02,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2025-04-14 13:43:02,629 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,629 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,629 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,629 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:02,629 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:02,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:02,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-14 13:43:02,782 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:02,782 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:02,782 INFO L139 ounterexampleChecker]: Examining path program with hash 74273368, occurence #1 [2025-04-14 13:43:02,782 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:02,782 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:02,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 246643505, now seen corresponding path program 1 times [2025-04-14 13:43:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:02,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474739101] [2025-04-14 13:43:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:02,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:43:02,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:43:02,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:02,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:02,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474739101] [2025-04-14 13:43:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474739101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 13:43:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665803729] [2025-04-14 13:43:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:02,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:43:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:02,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:43:02,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:43:02,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,834 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:02,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-14 13:43:02,834 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,834 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,834 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,834 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:02,834 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:02,834 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:02,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:02,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:02,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:02,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:02,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:02,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-14 13:43:02,995 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:02,995 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:02,996 INFO L139 ounterexampleChecker]: Examining path program with hash 834957854, occurence #1 [2025-04-14 13:43:02,996 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:02,996 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:02,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash -637478504, now seen corresponding path program 1 times [2025-04-14 13:43:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:02,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048314439] [2025-04-14 13:43:02,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:03,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 13:43:03,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 13:43:03,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:03,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048314439] [2025-04-14 13:43:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048314439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:03,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:03,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:43:03,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852560802] [2025-04-14 13:43:03,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:03,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 13:43:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:03,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 13:43:03,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-14 13:43:03,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,058 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:03,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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) [2025-04-14 13:43:03,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,059 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:43:03,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-14 13:43:03,239 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:03,239 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:03,239 INFO L139 ounterexampleChecker]: Examining path program with hash -1928940040, occurence #1 [2025-04-14 13:43:03,239 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:03,239 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:03,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1825186362, now seen corresponding path program 1 times [2025-04-14 13:43:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:03,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243511589] [2025-04-14 13:43:03,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:03,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:43:03,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:43:03,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:03,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:03,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243511589] [2025-04-14 13:43:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243511589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:03,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 13:43:03,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878648121] [2025-04-14 13:43:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:03,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 13:43:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:03,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 13:43:03,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-14 13:43:03,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,306 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:03,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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) [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:43:03,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:43:03,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:43:03,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-14 13:43:03,466 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:03,466 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:03,466 INFO L139 ounterexampleChecker]: Examining path program with hash 190886367, occurence #1 [2025-04-14 13:43:03,466 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:03,466 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:03,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:03,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1944524366, now seen corresponding path program 1 times [2025-04-14 13:43:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:03,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703509692] [2025-04-14 13:43:03,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:03,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:03,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-14 13:43:03,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-14 13:43:03,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:03,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:03,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:03,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703509692] [2025-04-14 13:43:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703509692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:03,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 13:43:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581112922] [2025-04-14 13:43:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:03,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 13:43:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:03,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 13:43:03,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-04-14 13:43:03,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,545 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:03,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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) [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:43:03,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:43:03,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 13:43:03,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-14 13:43:03,713 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:43:03,713 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:43:03,713 INFO L139 ounterexampleChecker]: Examining path program with hash -1773549324, occurence #1 [2025-04-14 13:43:03,714 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:43:03,714 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:43:03,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:43:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 686592110, now seen corresponding path program 1 times [2025-04-14 13:43:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:43:03,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145098931] [2025-04-14 13:43:03,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:43:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:43:03,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-14 13:43:03,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-14 13:43:03,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:03,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:43:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:43:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:43:03,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145098931] [2025-04-14 13:43:03,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145098931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:43:03,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:43:03,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-14 13:43:03,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275602399] [2025-04-14 13:43:03,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:43:03,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 13:43:03,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:43:03,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 13:43:03,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-04-14 13:43:03,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:43:03,812 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:43:03,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 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) [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 13:43:03,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:44:39,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:44:39,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 13:44:39,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 13:44:39,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:44:39,391 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:44:39,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-14 13:44:39,392 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 13:44:39,392 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of8ForFork0 was SAFE (1/9) [2025-04-14 13:44:39,393 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:44:39,393 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:44:39,393 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of8ForFork0 ======== [2025-04-14 13:44:39,393 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:44:39,393 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:46:19,753 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:46:19,753 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:46:19,753 INFO L320 ceAbstractionStarter]: Result for error location f2Thread7of8ForFork0 was SAFE (2/9) [2025-04-14 13:46:19,755 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:46:19,755 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:46:19,755 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of8ForFork0 ======== [2025-04-14 13:46:19,755 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:46:19,755 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:48:03,573 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:48:03,578 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 13:48:03,578 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of8ForFork0 was SAFE (3/9) [2025-04-14 13:48:03,579 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:48:03,580 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:48:03,580 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of8ForFork0 ======== [2025-04-14 13:48:03,580 INFO L340 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, 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;@349c087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:48:03,580 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.