./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_03-munge_racing.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_03-munge_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7df5d4e763d99c6ca9aa3d4daa03dcc5b8b9d65829db9a89ff85ebe5a14f3ac3 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 16:53:30,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 16:53:30,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 16:53:30,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 16:53:30,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 16:53:30,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 16:53:30,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 16:53:30,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 16:53:30,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 16:53:30,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 16:53:30,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 16:53:30,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 16:53:30,698 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 16:53:30,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 16:53:30,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 16:53:30,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 16:53:30,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 16:53:30,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 16:53:30,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 16:53:30,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7df5d4e763d99c6ca9aa3d4daa03dcc5b8b9d65829db9a89ff85ebe5a14f3ac3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-23 16:53:30,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 16:53:30,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 16:53:30,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 16:53:30,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 16:53:30,951 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 16:53:30,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_03-munge_racing.i [2025-01-23 16:53:32,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/5256a9561/e6a1e9a9dcb9448e9560a0d194bdcfa4/FLAG5472685c4 [2025-01-23 16:53:32,334 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 16:53:32,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_03-munge_racing.i [2025-01-23 16:53:32,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/5256a9561/e6a1e9a9dcb9448e9560a0d194bdcfa4/FLAG5472685c4 [2025-01-23 16:53:32,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/5256a9561/e6a1e9a9dcb9448e9560a0d194bdcfa4 [2025-01-23 16:53:32,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 16:53:32,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 16:53:32,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 16:53:32,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 16:53:32,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 16:53:32,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c37eaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32, skipping insertion in model container [2025-01-23 16:53:32,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 16:53:32,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_03-munge_racing.i[30176,30189] [2025-01-23 16:53:32,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 16:53:32,668 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 16:53:32,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_03-munge_racing.i[30176,30189] [2025-01-23 16:53:32,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 16:53:32,789 INFO L204 MainTranslator]: Completed translation [2025-01-23 16:53:32,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32 WrapperNode [2025-01-23 16:53:32,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 16:53:32,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 16:53:32,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 16:53:32,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 16:53:32,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,822 INFO L138 Inliner]: procedures = 173, calls = 47, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 200 [2025-01-23 16:53:32,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 16:53:32,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 16:53:32,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 16:53:32,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 16:53:32,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 16:53:32,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 16:53:32,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 16:53:32,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 16:53:32,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (1/1) ... [2025-01-23 16:53:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 16:53:32,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 16:53:32,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 16:53:32,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-23 16:53:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-23 16:53:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-01-23 16:53:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-01-23 16:53:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-23 16:53:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 16:53:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 16:53:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 16:53:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 16:53:32,896 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 16:53:32,985 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 16:53:32,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 16:53:33,222 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 16:53:33,223 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 16:53:33,358 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 16:53:33,359 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-23 16:53:33,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 04:53:33 BoogieIcfgContainer [2025-01-23 16:53:33,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 16:53:33,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 16:53:33,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 16:53:33,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 16:53:33,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 04:53:32" (1/3) ... [2025-01-23 16:53:33,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57322c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 04:53:33, skipping insertion in model container [2025-01-23 16:53:33,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:53:32" (2/3) ... [2025-01-23 16:53:33,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57322c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 04:53:33, skipping insertion in model container [2025-01-23 16:53:33,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 04:53:33" (3/3) ... [2025-01-23 16:53:33,368 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_03-munge_racing.i [2025-01-23 16:53:33,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 16:53:33,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_03-munge_racing.i that has 3 procedures, 74 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-01-23 16:53:33,382 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 16:53:33,424 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-23 16:53:33,458 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 16:53:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 16:53:33,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 16:53:33,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 16:53:33,520 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:53:33,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2025-01-23 16:53:33,535 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:33,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 16:53:33,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:33,875 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:33,876 INFO L139 ounterexampleChecker]: Examining path program with hash -1135933417, occurence #1 [2025-01-23 16:53:33,876 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:33,876 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:33,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1074537559, now seen corresponding path program 1 times [2025-01-23 16:53:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:33,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502190024] [2025-01-23 16:53:33,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:33,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-23 16:53:33,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 16:53:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502190024] [2025-01-23 16:53:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502190024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:34,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:53:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79139850] [2025-01-23 16:53:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:34,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:53:34,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:34,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:53:34,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:53:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:34,050 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:34,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-01-23 16:53:34,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 16:53:35,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:35,234 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:35,234 INFO L139 ounterexampleChecker]: Examining path program with hash -1357710502, occurence #1 [2025-01-23 16:53:35,234 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:35,234 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1787831393, now seen corresponding path program 1 times [2025-01-23 16:53:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912647220] [2025-01-23 16:53:35,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:35,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-23 16:53:35,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 16:53:35,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:35,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:35,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912647220] [2025-01-23 16:53:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912647220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:35,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:35,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 16:53:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240012945] [2025-01-23 16:53:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 16:53:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:35,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 16:53:35,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 16:53:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,379 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-01-23 16:53:35,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 16:53:35,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 16:53:35,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 16:53:35,637 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 16:53:35,640 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE (1/3) [2025-01-23 16:53:35,644 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:35,647 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:53:35,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork0 ======== [2025-01-23 16:53:35,648 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:35,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 16:53:35,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:35,656 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:35,656 INFO L139 ounterexampleChecker]: Examining path program with hash 1824070172, occurence #1 [2025-01-23 16:53:35,656 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:35,656 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:35,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash 848957327, now seen corresponding path program 1 times [2025-01-23 16:53:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:35,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480223611] [2025-01-23 16:53:35,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:35,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-23 16:53:35,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-23 16:53:35,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:35,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:35,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480223611] [2025-01-23 16:53:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480223611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:35,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:53:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22676813] [2025-01-23 16:53:35,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:35,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:53:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:35,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:53:35,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:53:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:35,700 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-01-23 16:53:35,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:36,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:36,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 16:53:36,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:36,512 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:36,512 INFO L139 ounterexampleChecker]: Examining path program with hash -1242161375, occurence #1 [2025-01-23 16:53:36,515 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:36,516 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1137593705, now seen corresponding path program 1 times [2025-01-23 16:53:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681486786] [2025-01-23 16:53:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:36,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-23 16:53:36,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-23 16:53:36,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:36,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:36,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:36,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681486786] [2025-01-23 16:53:36,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681486786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:36,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 16:53:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959035114] [2025-01-23 16:53:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 16:53:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:36,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 16:53:36,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 16:53:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:36,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:36,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-01-23 16:53:36,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:36,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:53:37,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 16:53:37,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:37,046 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:37,046 INFO L139 ounterexampleChecker]: Examining path program with hash -1704181669, occurence #1 [2025-01-23 16:53:37,046 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:37,046 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:37,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 5927840, now seen corresponding path program 1 times [2025-01-23 16:53:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409055614] [2025-01-23 16:53:37,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:37,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 16:53:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 16:53:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409055614] [2025-01-23 16:53:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409055614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:37,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 16:53:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108730512] [2025-01-23 16:53:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:37,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 16:53:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:37,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 16:53:37,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 16:53:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,105 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:37,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-01-23 16:53:37,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:53:37,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:53:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 16:53:37,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 16:53:37,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 16:53:37,151 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 16:53:37,152 INFO L319 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork0 was SAFE (2/3) [2025-01-23 16:53:37,154 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:37,154 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:53:37,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 16:53:37,156 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:37,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 16:53:37,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 16:53:37,159 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:37,159 INFO L139 ounterexampleChecker]: Examining path program with hash -889264905, occurence #1 [2025-01-23 16:53:37,159 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:37,159 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1839596604, now seen corresponding path program 1 times [2025-01-23 16:53:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:37,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076159728] [2025-01-23 16:53:37,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:37,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 16:53:37,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 16:53:37,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:37,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076159728] [2025-01-23 16:53:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076159728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:53:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649299354] [2025-01-23 16:53:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:37,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:53:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:37,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:53:37,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:53:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-23 16:53:37,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:37,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 16:53:37,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 16:53:37,189 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:37,189 INFO L139 ounterexampleChecker]: Examining path program with hash 314525448, occurence #1 [2025-01-23 16:53:37,189 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:37,189 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:37,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -79176963, now seen corresponding path program 1 times [2025-01-23 16:53:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296719884] [2025-01-23 16:53:37,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:37,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-23 16:53:37,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-23 16:53:37,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:37,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 16:53:37,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 16:53:37,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-23 16:53:37,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-23 16:53:37,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:37,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 16:53:37,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 16:53:37,235 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 16:53:37,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 16:53:37,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-23 16:53:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 16:53:37,236 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 16:53:37,236 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (3/3) [2025-01-23 16:53:37,237 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 16:53:37,237 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 16:53:37,257 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-23 16:53:37,261 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:37,275 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:53:37,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of2ForFork1 ======== [2025-01-23 16:53:37,277 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:53:37,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 16:53:38,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:38,144 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:38,144 INFO L139 ounterexampleChecker]: Examining path program with hash 860247970, occurence #1 [2025-01-23 16:53:38,144 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:38,144 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:38,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1849152853, now seen corresponding path program 1 times [2025-01-23 16:53:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907232102] [2025-01-23 16:53:38,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 16:53:38,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 16:53:38,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:38,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:38,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:38,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907232102] [2025-01-23 16:53:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907232102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:53:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622203645] [2025-01-23 16:53:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:38,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:53:38,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:38,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:53:38,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:53:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:38,171 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-01-23 16:53:38,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:48,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 16:53:48,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:48,443 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:48,443 INFO L139 ounterexampleChecker]: Examining path program with hash 903312497, occurence #1 [2025-01-23 16:53:48,443 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:48,443 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:48,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash -723515428, now seen corresponding path program 1 times [2025-01-23 16:53:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33589716] [2025-01-23 16:53:48,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:48,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-23 16:53:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-23 16:53:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:48,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33589716] [2025-01-23 16:53:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33589716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:48,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:48,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:53:48,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123328024] [2025-01-23 16:53:48,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:48,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:53:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:48,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:53:48,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:53:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:48,701 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:48,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 16:53:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:53:59,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 16:53:59,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:53:59,736 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:53:59,736 INFO L139 ounterexampleChecker]: Examining path program with hash -737269476, occurence #1 [2025-01-23 16:53:59,736 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:53:59,736 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:53:59,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:53:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1716448612, now seen corresponding path program 1 times [2025-01-23 16:53:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:53:59,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600539562] [2025-01-23 16:53:59,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:53:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:53:59,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-23 16:53:59,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-23 16:53:59,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:53:59,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:53:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:53:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:53:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600539562] [2025-01-23 16:53:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600539562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:53:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:53:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 16:53:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780496294] [2025-01-23 16:53:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:53:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:53:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:53:59,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:53:59,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:53:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:59,838 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:53:59,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-01-23 16:53:59,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:53:59,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:53:59,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:00,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 16:54:00,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-23 16:54:00,366 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 16:54:00,366 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread1of2ForFork1 was SAFE (1/5) [2025-01-23 16:54:00,367 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:54:00,368 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:54:00,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 16:54:00,368 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:54:00,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 16:54:00,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 16:54:00,371 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:00,371 INFO L139 ounterexampleChecker]: Examining path program with hash 1633967994, occurence #1 [2025-01-23 16:54:00,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:00,371 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:00,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash 455317732, now seen corresponding path program 1 times [2025-01-23 16:54:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129448566] [2025-01-23 16:54:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:54:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:00,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 16:54:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 16:54:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:54:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:54:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:54:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:54:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129448566] [2025-01-23 16:54:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129448566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:54:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:54:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:54:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939069989] [2025-01-23 16:54:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:54:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:54:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:54:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:54:00,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:54:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,384 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:54:00,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-01-23 16:54:00,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-23 16:54:00,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 16:54:00,405 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:00,405 INFO L139 ounterexampleChecker]: Examining path program with hash -289293533, occurence #1 [2025-01-23 16:54:00,405 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:00,405 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:00,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1014512931, now seen corresponding path program 1 times [2025-01-23 16:54:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267379874] [2025-01-23 16:54:00,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:54:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:00,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-23 16:54:00,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-23 16:54:00,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:54:00,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:54:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:54:00,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:54:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267379874] [2025-01-23 16:54:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267379874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:54:00,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:54:00,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:54:00,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177807433] [2025-01-23 16:54:00,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:54:00,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:54:00,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:54:00,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:54:00,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:54:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:54:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-23 16:54:00,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:00,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-23 16:54:00,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 16:54:00,522 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:00,522 INFO L139 ounterexampleChecker]: Examining path program with hash -489748608, occurence #1 [2025-01-23 16:54:00,522 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:00,522 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:00,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1877260102, now seen corresponding path program 1 times [2025-01-23 16:54:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675901068] [2025-01-23 16:54:00,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:54:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:00,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-23 16:54:00,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-23 16:54:00,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:54:00,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 16:54:00,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 16:54:00,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-23 16:54:00,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-23 16:54:00,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:54:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 16:54:00,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 16:54:00,564 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 16:54:00,564 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 16:54:00,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-23 16:54:00,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-23 16:54:00,565 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 16:54:00,565 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/5) [2025-01-23 16:54:00,565 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 16:54:00,565 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-23 16:54:00,588 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-23 16:54:00,590 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:54:00,604 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:54:00,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread3of3ForFork1 ======== [2025-01-23 16:54:00,604 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:54:00,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 16:54:01,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:54:01,252 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:01,252 INFO L139 ounterexampleChecker]: Examining path program with hash -2124626414, occurence #1 [2025-01-23 16:54:01,252 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:01,252 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:01,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1299798829, now seen corresponding path program 1 times [2025-01-23 16:54:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180825280] [2025-01-23 16:54:01,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:54:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:01,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-23 16:54:01,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-23 16:54:01,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:54:01,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:54:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:54:01,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:54:01,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180825280] [2025-01-23 16:54:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180825280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:54:01,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:54:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:54:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332897532] [2025-01-23 16:54:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:54:01,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:54:01,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:54:01,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:54:01,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:54:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:01,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:54:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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-01-23 16:54:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:14,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-23 16:54:14,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:54:14,692 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:14,692 INFO L139 ounterexampleChecker]: Examining path program with hash 136660864, occurence #1 [2025-01-23 16:54:14,693 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:14,693 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:14,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash -848241573, now seen corresponding path program 1 times [2025-01-23 16:54:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:14,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056233492] [2025-01-23 16:54:14,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:54:14,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:14,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-23 16:54:14,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 16:54:14,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:54:14,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:54:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:54:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:54:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056233492] [2025-01-23 16:54:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056233492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:54:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:54:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:54:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966067509] [2025-01-23 16:54:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:54:14,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:54:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:54:14,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:54:14,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:54:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:14,890 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:54:14,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 16:54:14,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:14,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:19,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-23 16:54:19,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:54:19,650 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:19,651 INFO L139 ounterexampleChecker]: Examining path program with hash -2052067074, occurence #1 [2025-01-23 16:54:19,651 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:19,651 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1315038687, now seen corresponding path program 2 times [2025-01-23 16:54:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051873046] [2025-01-23 16:54:19,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 16:54:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:19,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 1 equivalence classes. [2025-01-23 16:54:19,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 16:54:19,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 16:54:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:54:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:54:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:54:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051873046] [2025-01-23 16:54:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051873046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:54:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:54:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:54:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238167369] [2025-01-23 16:54:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:54:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:54:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:54:19,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:54:19,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:54:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:19,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:54:19,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-01-23 16:54:19,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:19,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:19,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:25,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-23 16:54:25,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:54:25,150 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:54:25,150 INFO L139 ounterexampleChecker]: Examining path program with hash -1804243970, occurence #1 [2025-01-23 16:54:25,150 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:54:25,150 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:54:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:54:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash -184361919, now seen corresponding path program 3 times [2025-01-23 16:54:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:54:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185679145] [2025-01-23 16:54:25,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 16:54:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:54:25,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 1 equivalence classes. [2025-01-23 16:54:25,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 16:54:25,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 16:54:25,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:54:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:54:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:54:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185679145] [2025-01-23 16:54:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185679145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:54:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:54:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:54:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085036213] [2025-01-23 16:54:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:54:25,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:54:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:54:25,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:54:25,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:54:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:25,324 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:54:25,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 16:54:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:54:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:54:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:55:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:55:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:55:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:55:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:55:43,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-23 16:55:43,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:55:43,662 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:55:43,662 INFO L139 ounterexampleChecker]: Examining path program with hash -1018869586, occurence #1 [2025-01-23 16:55:43,662 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:55:43,662 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:55:43,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:55:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash -594375203, now seen corresponding path program 4 times [2025-01-23 16:55:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:55:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351996704] [2025-01-23 16:55:43,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 16:55:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:55:43,679 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 122 statements into 2 equivalence classes. [2025-01-23 16:55:43,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 107 of 122 statements. [2025-01-23 16:55:43,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-23 16:55:43,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:55:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:55:43,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:55:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351996704] [2025-01-23 16:55:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351996704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:55:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:55:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:55:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036695103] [2025-01-23 16:55:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:55:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:55:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:55:43,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:55:43,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:55:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:55:43,814 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:55:43,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 16:55:43,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:55:43,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:55:43,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:55:43,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:55:43,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-23 16:56:29,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:56:29,245 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:56:29,245 INFO L139 ounterexampleChecker]: Examining path program with hash 531801356, occurence #1 [2025-01-23 16:56:29,245 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:56:29,245 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:56:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:56:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash -732484021, now seen corresponding path program 1 times [2025-01-23 16:56:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:56:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757557781] [2025-01-23 16:56:29,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:56:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:56:29,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-23 16:56:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-23 16:56:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:56:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:56:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:56:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:56:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757557781] [2025-01-23 16:56:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757557781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:56:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:56:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:56:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809065586] [2025-01-23 16:56:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:56:29,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:56:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:56:29,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:56:29,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:56:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:29,595 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:56:29,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 16:56:29,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:29,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:29,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:56:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-23 16:56:30,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:56:30,309 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:56:30,309 INFO L139 ounterexampleChecker]: Examining path program with hash 840654366, occurence #1 [2025-01-23 16:56:30,309 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:56:30,309 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:56:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:56:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 690088451, now seen corresponding path program 5 times [2025-01-23 16:56:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:56:30,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031403364] [2025-01-23 16:56:30,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-23 16:56:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:56:30,323 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 122 statements into 1 equivalence classes. [2025-01-23 16:56:30,331 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 16:56:30,331 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 16:56:30,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:56:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:56:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:56:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031403364] [2025-01-23 16:56:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031403364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:56:30,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:56:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:56:30,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084698659] [2025-01-23 16:56:30,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:56:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 16:56:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:56:30,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 16:56:30,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-23 16:56:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:30,411 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:56:30,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 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-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:56:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:56:38,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 16:56:38,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-23 16:56:38,556 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2025-01-23 16:56:38,556 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread3of3ForFork1 was SAFE (1/7) [2025-01-23 16:56:38,558 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:56:38,558 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:56:38,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of3ForFork1 ======== [2025-01-23 16:56:38,559 INFO L333 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;@657e5bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:56:38,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 16:56:39,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 16:56:39,490 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:56:39,490 INFO L139 ounterexampleChecker]: Examining path program with hash -1170445202, occurence #1 [2025-01-23 16:56:39,491 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:56:39,491 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:56:39,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:56:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1944847980, now seen corresponding path program 1 times [2025-01-23 16:56:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:56:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89543198] [2025-01-23 16:56:39,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:56:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:56:39,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-23 16:56:39,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-23 16:56:39,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:56:39,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:56:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:56:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:56:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89543198] [2025-01-23 16:56:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89543198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:56:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:56:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 16:56:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288840995] [2025-01-23 16:56:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:56:39,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 16:56:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:56:39,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 16:56:39,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 16:56:39,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:56:39,507 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:56:39,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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-01-23 16:56:39,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.