./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_04-munge_racefree.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_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_04-munge_racefree.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 50de8acec85b0b2508f1f33521d9ab6717fa1b5141d6b9e2d08fcb4af894112b --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 00:17:59,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 00:17:59,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 00:17:59,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 00:17:59,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 00:17:59,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 00:17:59,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 00:17:59,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 00:17:59,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 00:17:59,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 00:17:59,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 00:17:59,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 00:17:59,845 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 00:17:59,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 00:17:59,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 00:17:59,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 00:17:59,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 00:17:59,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 00:17:59,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 00:17:59,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 00:17:59,849 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 00:17:59,849 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 00:17:59,849 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 -> 50de8acec85b0b2508f1f33521d9ab6717fa1b5141d6b9e2d08fcb4af894112b 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 -> NECESSARY_AND_SUFFICIENT [2025-01-24 00:18:00,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 00:18:00,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 00:18:00,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 00:18:00,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 00:18:00,109 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 00:18:00,110 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_04-munge_racefree.i [2025-01-24 00:18:01,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/51e7043a6/0db93185b83a4b49b5494c713f20989d/FLAGb54c67efd [2025-01-24 00:18:01,418 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 00:18:01,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_04-munge_racefree.i [2025-01-24 00:18:01,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/51e7043a6/0db93185b83a4b49b5494c713f20989d/FLAGb54c67efd [2025-01-24 00:18:01,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/51e7043a6/0db93185b83a4b49b5494c713f20989d [2025-01-24 00:18:01,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 00:18:01,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 00:18:01,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 00:18:01,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 00:18:01,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 00:18:01,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:18:01" (1/1) ... [2025-01-24 00:18:01,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61211c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:01, skipping insertion in model container [2025-01-24 00:18:01,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:18:01" (1/1) ... [2025-01-24 00:18:01,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 00:18:01,964 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_04-munge_racefree.i[30176,30189] [2025-01-24 00:18:01,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 00:18:01,990 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 00:18:02,047 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_04-munge_racefree.i[30176,30189] [2025-01-24 00:18:02,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 00:18:02,081 INFO L204 MainTranslator]: Completed translation [2025-01-24 00:18:02,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02 WrapperNode [2025-01-24 00:18:02,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 00:18:02,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 00:18:02,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 00:18:02,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 00:18:02,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,113 INFO L138 Inliner]: procedures = 173, calls = 41, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 248 [2025-01-24 00:18:02,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 00:18:02,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 00:18:02,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 00:18:02,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 00:18:02,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 00:18:02,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 00:18:02,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 00:18:02,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 00:18:02,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (1/1) ... [2025-01-24 00:18:02,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 00:18:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 00:18:02,155 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-24 00:18:02,160 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-24 00:18:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-24 00:18:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-24 00:18:02,173 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-24 00:18:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-24 00:18:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-01-24 00:18:02,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-24 00:18:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 00:18:02,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 00:18:02,175 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 00:18:02,279 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 00:18:02,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 00:18:02,541 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 00:18:02,542 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 00:18:02,802 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 00:18:02,803 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-24 00:18:02,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:18:02 BoogieIcfgContainer [2025-01-24 00:18:02,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 00:18:02,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 00:18:02,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 00:18:02,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 00:18:02,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:18:01" (1/3) ... [2025-01-24 00:18:02,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6ab9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:18:02, skipping insertion in model container [2025-01-24 00:18:02,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:02" (2/3) ... [2025-01-24 00:18:02,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6ab9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:18:02, skipping insertion in model container [2025-01-24 00:18:02,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:18:02" (3/3) ... [2025-01-24 00:18:02,812 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_04-munge_racefree.i [2025-01-24 00:18:02,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 00:18:02,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_04-munge_racefree.i that has 3 procedures, 74 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-01-24 00:18:02,823 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 00:18:02,865 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-24 00:18:02,898 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:02,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 00:18:02,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 00:18:02,900 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-24 00:18:02,902 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-24 00:18:02,964 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:18:02,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2025-01-24 00:18:02,982 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;@62c5c53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:02,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 00:18:03,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:03,295 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:03,296 INFO L139 ounterexampleChecker]: Examining path program with hash -923067611, occurence #1 [2025-01-24 00:18:03,297 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:03,297 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1036817139, now seen corresponding path program 1 times [2025-01-24 00:18:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:03,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320164906] [2025-01-24 00:18:03,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:03,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-24 00:18:03,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-24 00:18:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:03,518 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-24 00:18:03,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320164906] [2025-01-24 00:18:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320164906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:03,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:18:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230270305] [2025-01-24 00:18:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:18:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:03,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:18:03,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:18:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:03,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:03,537 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-24 00:18:03,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:04,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 00:18:04,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:04,777 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:04,777 INFO L139 ounterexampleChecker]: Examining path program with hash 1137390426, occurence #1 [2025-01-24 00:18:04,777 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:04,777 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:04,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash -498514107, now seen corresponding path program 1 times [2025-01-24 00:18:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362309430] [2025-01-24 00:18:04,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-24 00:18:04,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-24 00:18:04,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:04,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:04,962 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-24 00:18:04,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362309430] [2025-01-24 00:18:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362309430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:18:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178082858] [2025-01-24 00:18:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:04,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:18:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:04,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:18:04,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:18:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:04,969 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:04,969 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-24 00:18:04,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:04,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:18:05,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 00:18:05,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-24 00:18:05,209 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-24 00:18:05,210 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE (1/3) [2025-01-24 00:18:05,214 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:05,215 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:18:05,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork0 ======== [2025-01-24 00:18:05,216 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;@62c5c53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:05,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 00:18:05,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:05,225 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:05,225 INFO L139 ounterexampleChecker]: Examining path program with hash -301344756, occurence #1 [2025-01-24 00:18:05,225 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:05,225 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:05,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:05,225 INFO L85 PathProgramCache]: Analyzing trace with hash -513790093, now seen corresponding path program 1 times [2025-01-24 00:18:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680851855] [2025-01-24 00:18:05,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 00:18:05,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 00:18:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:05,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:05,284 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-24 00:18:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680851855] [2025-01-24 00:18:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680851855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:18:05,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760610592] [2025-01-24 00:18:05,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:05,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:18:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:05,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:18:05,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:18:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:05,285 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:05,285 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-24 00:18:05,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-24 00:18:06,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:06,076 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:06,076 INFO L139 ounterexampleChecker]: Examining path program with hash -1992262616, occurence #1 [2025-01-24 00:18:06,076 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:06,076 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:06,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:06,077 INFO L85 PathProgramCache]: Analyzing trace with hash 867468877, now seen corresponding path program 1 times [2025-01-24 00:18:06,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:06,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220696096] [2025-01-24 00:18:06,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:06,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:06,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-24 00:18:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-24 00:18:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:06,175 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-24 00:18:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:06,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220696096] [2025-01-24 00:18:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220696096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:06,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:06,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:18:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027671241] [2025-01-24 00:18:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:18:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:06,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:18:06,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:18:06,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,177 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:06,177 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-24 00:18:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:06,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-24 00:18:06,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:06,582 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:06,583 INFO L139 ounterexampleChecker]: Examining path program with hash 109950781, occurence #1 [2025-01-24 00:18:06,583 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:06,583 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:06,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash -843193980, now seen corresponding path program 1 times [2025-01-24 00:18:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847936026] [2025-01-24 00:18:06,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:06,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:06,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-24 00:18:06,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-24 00:18:06,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:06,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:06,677 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-24 00:18:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847936026] [2025-01-24 00:18:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847936026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:18:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635117683] [2025-01-24 00:18:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:06,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:18:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:06,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:18:06,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:18:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:06,680 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-24 00:18:06,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:06,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:18:06,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 00:18:06,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-24 00:18:06,732 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-24 00:18:06,733 INFO L319 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork0 was SAFE (2/3) [2025-01-24 00:18:06,735 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:06,738 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:18:06,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:18:06,740 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;@62c5c53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:06,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:18:06,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:18:06,744 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:06,744 INFO L139 ounterexampleChecker]: Examining path program with hash -307045371, occurence #1 [2025-01-24 00:18:06,744 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:06,744 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash -570069188, now seen corresponding path program 1 times [2025-01-24 00:18:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528016977] [2025-01-24 00:18:06,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:06,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-24 00:18:06,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-24 00:18:06,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:06,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:06,781 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-24 00:18:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:06,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528016977] [2025-01-24 00:18:06,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528016977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:06,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:18:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395858045] [2025-01-24 00:18:06,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:18:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:06,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:18:06,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:18:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,783 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:06,783 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-24 00:18:06,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:06,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-24 00:18:06,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:18:06,797 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:06,797 INFO L139 ounterexampleChecker]: Examining path program with hash -221913555, occurence #1 [2025-01-24 00:18:06,797 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:06,797 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:06,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1782754529, now seen corresponding path program 1 times [2025-01-24 00:18:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611811440] [2025-01-24 00:18:06,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:06,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-24 00:18:06,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-24 00:18:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:18:06,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:18:06,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-24 00:18:06,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-24 00:18:06,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:06,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:18:06,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:18:06,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:18:06,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:18:06,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-24 00:18:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-24 00:18:06,863 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-24 00:18:06,864 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (3/3) [2025-01-24 00:18:06,864 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:18:06,864 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-24 00:18:06,901 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-24 00:18:06,905 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:06,917 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:18:06,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of2ForFork1 ======== [2025-01-24 00:18:06,918 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;@62c5c53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:06,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 00:18:07,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:07,830 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:07,830 INFO L139 ounterexampleChecker]: Examining path program with hash 633706224, occurence #1 [2025-01-24 00:18:07,830 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:07,830 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:07,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 786122297, now seen corresponding path program 1 times [2025-01-24 00:18:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:07,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839503670] [2025-01-24 00:18:07,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:07,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-24 00:18:07,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-24 00:18:07,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:07,871 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-24 00:18:07,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:07,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839503670] [2025-01-24 00:18:07,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839503670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:07,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:07,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:18:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899923217] [2025-01-24 00:18:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:18:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:07,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:18:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:18:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:07,874 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:07,874 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-24 00:18:07,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-24 00:18:18,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:18,075 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:18,075 INFO L139 ounterexampleChecker]: Examining path program with hash -491520046, occurence #1 [2025-01-24 00:18:18,075 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:18,076 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1544528988, now seen corresponding path program 1 times [2025-01-24 00:18:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184515083] [2025-01-24 00:18:18,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-24 00:18:18,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-24 00:18:18,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:18,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:18,331 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-24 00:18:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184515083] [2025-01-24 00:18:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184515083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:18,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:18:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142634908] [2025-01-24 00:18:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:18,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:18:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:18,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:18:18,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:18:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:18,333 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:18,334 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-24 00:18:18,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:18,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-24 00:18:30,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:30,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:30,041 INFO L139 ounterexampleChecker]: Examining path program with hash -92847224, occurence #1 [2025-01-24 00:18:30,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:30,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:30,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1024627300, now seen corresponding path program 1 times [2025-01-24 00:18:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210462415] [2025-01-24 00:18:30,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:30,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-24 00:18:30,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-24 00:18:30,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:30,235 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-24 00:18:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210462415] [2025-01-24 00:18:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210462415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:30,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:30,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:18:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376623771] [2025-01-24 00:18:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:18:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:30,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:18:30,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:18:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:30,238 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 00:18:30,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:30,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:30,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 00:18:35,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-24 00:18:35,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:35,279 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:35,280 INFO L139 ounterexampleChecker]: Examining path program with hash -805297315, occurence #1 [2025-01-24 00:18:35,280 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:35,280 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 507247146, now seen corresponding path program 1 times [2025-01-24 00:18:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255240778] [2025-01-24 00:18:35,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:35,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-24 00:18:35,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-24 00:18:35,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:35,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:35,417 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-24 00:18:35,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:35,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255240778] [2025-01-24 00:18:35,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255240778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:35,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:35,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:18:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505271265] [2025-01-24 00:18:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:35,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:18:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:35,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:18:35,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:18:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:35,418 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 00:18:35,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:35,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:35,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 00:18:35,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 00:18:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 00:18:40,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-24 00:18:40,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:40,522 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:40,522 INFO L139 ounterexampleChecker]: Examining path program with hash 1354171566, occurence #1 [2025-01-24 00:18:40,522 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:40,522 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1411471566, now seen corresponding path program 1 times [2025-01-24 00:18:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081696682] [2025-01-24 00:18:40,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:40,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-24 00:18:40,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-24 00:18:40,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:40,586 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-24 00:18:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:40,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081696682] [2025-01-24 00:18:40,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081696682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:40,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:40,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 00:18:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837469198] [2025-01-24 00:18:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:40,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:18:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:40,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:18:40,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:18:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:40,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:40,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-24 00:18:40,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:40,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:40,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 00:18:40,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 00:18:40,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 00:18:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 00:18:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:41,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 00:18:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-24 00:18:41,250 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-24 00:18:41,250 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread1of2ForFork1 was SAFE (1/5) [2025-01-24 00:18:41,252 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:41,252 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:18:41,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:18:41,253 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;@62c5c53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:41,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:18:41,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:18:41,256 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:41,256 INFO L139 ounterexampleChecker]: Examining path program with hash -245222098, occurence #1 [2025-01-24 00:18:41,256 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:41,256 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:41,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 820075592, now seen corresponding path program 1 times [2025-01-24 00:18:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074374874] [2025-01-24 00:18:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:41,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-24 00:18:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-24 00:18:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:41,276 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-24 00:18:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074374874] [2025-01-24 00:18:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074374874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:41,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:41,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:18:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086024083] [2025-01-24 00:18:41,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:18:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:41,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:18:41,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:18:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,277 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:41,277 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-24 00:18:41,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-24 00:18:41,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:18:41,296 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:41,297 INFO L139 ounterexampleChecker]: Examining path program with hash 2134941392, occurence #1 [2025-01-24 00:18:41,297 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:41,297 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:41,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash -310009891, now seen corresponding path program 1 times [2025-01-24 00:18:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901101702] [2025-01-24 00:18:41,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:41,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-24 00:18:41,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 00:18:41,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:41,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:41,428 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-24 00:18:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901101702] [2025-01-24 00:18:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901101702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:18:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481661603] [2025-01-24 00:18:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:41,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:18:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:41,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:18:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:18:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,430 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:41,430 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-24 00:18:41,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:18:41,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-24 00:18:41,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:18:41,505 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:41,505 INFO L139 ounterexampleChecker]: Examining path program with hash -189247379, occurence #1 [2025-01-24 00:18:41,505 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:41,505 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:41,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1661195078, now seen corresponding path program 1 times [2025-01-24 00:18:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:41,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10065945] [2025-01-24 00:18:41,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:41,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-24 00:18:41,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-24 00:18:41,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:41,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:18:41,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:18:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-24 00:18:41,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-24 00:18:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:41,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:18:41,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:18:41,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:18:41,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:18:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-24 00:18:41,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-24 00:18:41,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-24 00:18:41,549 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/5) [2025-01-24 00:18:41,550 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:18:41,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-24 00:18:41,590 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-24 00:18:41,593 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:41,607 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:18:41,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread3of3ForFork1 ======== [2025-01-24 00:18:41,608 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;@62c5c53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:18:41,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 00:18:42,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:42,323 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:42,323 INFO L139 ounterexampleChecker]: Examining path program with hash -552546489, occurence #1 [2025-01-24 00:18:42,323 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:42,323 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:42,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash -936284639, now seen corresponding path program 1 times [2025-01-24 00:18:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644220521] [2025-01-24 00:18:42,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:42,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-24 00:18:42,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-24 00:18:42,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:42,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:42,354 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-24 00:18:42,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:42,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644220521] [2025-01-24 00:18:42,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644220521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:42,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:42,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:18:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672268557] [2025-01-24 00:18:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:18:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:42,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:18:42,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:18:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:42,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:42,357 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-24 00:18:42,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:56,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-24 00:18:56,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:18:56,059 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:18:56,059 INFO L139 ounterexampleChecker]: Examining path program with hash -1908929972, occurence #1 [2025-01-24 00:18:56,059 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:18:56,059 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:18:56,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:18:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1777324261, now seen corresponding path program 1 times [2025-01-24 00:18:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:18:56,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849840220] [2025-01-24 00:18:56,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:18:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:18:56,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-24 00:18:56,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-24 00:18:56,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:18:56,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:18:56,231 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-24 00:18:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:18:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849840220] [2025-01-24 00:18:56,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849840220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:18:56,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:18:56,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:18:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270344990] [2025-01-24 00:18:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:18:56,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:18:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:18:56,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:18:56,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:18:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:56,233 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:18:56,233 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-24 00:18:56,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:18:56,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:19:01,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-24 00:19:01,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:19:01,149 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:19:01,149 INFO L139 ounterexampleChecker]: Examining path program with hash -839480042, occurence #1 [2025-01-24 00:19:01,149 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:19:01,149 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:19:01,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:19:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2050845921, now seen corresponding path program 2 times [2025-01-24 00:19:01,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:19:01,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755935972] [2025-01-24 00:19:01,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:19:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:19:01,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 1 equivalence classes. [2025-01-24 00:19:01,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-24 00:19:01,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:19:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:19:01,315 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-24 00:19:01,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:19:01,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755935972] [2025-01-24 00:19:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755935972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:19:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:19:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:19:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360890102] [2025-01-24 00:19:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:19:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:19:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:19:01,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:19:01,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:19:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:01,316 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:19:01,316 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-24 00:19:01,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:01,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:19:01,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:19:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:19:06,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-24 00:19:06,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:19:06,475 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:19:06,475 INFO L139 ounterexampleChecker]: Examining path program with hash 2138543561, occurence #1 [2025-01-24 00:19:06,475 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:19:06,475 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:19:06,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:19:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1113444607, now seen corresponding path program 3 times [2025-01-24 00:19:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:19:06,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377633550] [2025-01-24 00:19:06,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 00:19:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:19:06,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 1 equivalence classes. [2025-01-24 00:19:06,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-24 00:19:06,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-24 00:19:06,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:19:06,670 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-24 00:19:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:19:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377633550] [2025-01-24 00:19:06,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377633550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:19:06,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:19:06,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:19:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287370838] [2025-01-24 00:19:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:19:06,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:19:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:19:06,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:19:06,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:19:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:06,672 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:19:06,672 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-24 00:19:06,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:19:06,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:19:06,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:19:06,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:20:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:20:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:20:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:20:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:20:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-24 00:20:23,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 00:20:23,302 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:20:23,303 INFO L139 ounterexampleChecker]: Examining path program with hash -778371977, occurence #1 [2025-01-24 00:20:23,303 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:20:23,303 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:20:23,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:20:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1523457891, now seen corresponding path program 4 times [2025-01-24 00:20:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:20:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406938985] [2025-01-24 00:20:23,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 00:20:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:20:23,320 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 122 statements into 2 equivalence classes. [2025-01-24 00:20:23,322 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 107 of 122 statements. [2025-01-24 00:20:23,322 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-24 00:20:23,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:20:23,417 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-24 00:20:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:20:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406938985] [2025-01-24 00:20:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406938985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:20:23,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:20:23,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 00:20:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971349195] [2025-01-24 00:20:23,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:20:23,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:20:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:20:23,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:20:23,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:20:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:20:23,418 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:20:23,418 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-24 00:20:23,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:20:23,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:20:23,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:20:23,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 00:20:23,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.