./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 05:34:23,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 05:34:23,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 05:34:23,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 05:34:23,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 05:34:23,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 05:34:23,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 05:34:23,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 05:34:23,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 05:34:23,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 05:34:23,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 05:34:23,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 05:34:23,710 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 05:34:23,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 05:34:23,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 05:34:23,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 05:34:23,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 05:34:23,712 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 05:34:23,712 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/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 -> d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 05:34:23,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 05:34:23,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 05:34:23,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 05:34:23,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 05:34:23,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 05:34:23,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-20 05:34:25,179 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d488fdafe/eeddc5c78b504a49a64868b6f773cf85/FLAGe0ea7a5a1 [2025-03-20 05:34:25,352 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 05:34:25,354 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-20 05:34:25,360 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d488fdafe/eeddc5c78b504a49a64868b6f773cf85/FLAGe0ea7a5a1 [2025-03-20 05:34:27,281 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d488fdafe/eeddc5c78b504a49a64868b6f773cf85 [2025-03-20 05:34:27,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 05:34:27,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 05:34:27,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 05:34:27,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 05:34:27,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 05:34:27,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a836d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27, skipping insertion in model container [2025-03-20 05:34:27,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 05:34:27,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-20 05:34:27,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 05:34:27,425 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 05:34:27,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-20 05:34:27,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 05:34:27,456 INFO L204 MainTranslator]: Completed translation [2025-03-20 05:34:27,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27 WrapperNode [2025-03-20 05:34:27,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 05:34:27,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 05:34:27,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 05:34:27,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 05:34:27,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,484 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 134 [2025-03-20 05:34:27,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 05:34:27,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 05:34:27,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 05:34:27,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 05:34:27,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 05:34:27,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 05:34:27,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 05:34:27,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 05:34:27,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (1/1) ... [2025-03-20 05:34:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 05:34:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:27,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 05:34:27,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-20 05:34:27,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-20 05:34:27,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-20 05:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 05:34:27,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 05:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-20 05:34:27,568 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 05:34:27,645 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 05:34:27,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 05:34:27,797 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 05:34:27,797 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 05:34:27,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 05:34:27,922 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-20 05:34:27,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:34:27 BoogieIcfgContainer [2025-03-20 05:34:27,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 05:34:27,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 05:34:27,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 05:34:27,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 05:34:27,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 05:34:27" (1/3) ... [2025-03-20 05:34:27,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8444db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:34:27, skipping insertion in model container [2025-03-20 05:34:27,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:34:27" (2/3) ... [2025-03-20 05:34:27,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8444db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:34:27, skipping insertion in model container [2025-03-20 05:34:27,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:34:27" (3/3) ... [2025-03-20 05:34:27,933 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-03-20 05:34:27,942 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 05:34:27,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 27 locations, 30 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-20 05:34:27,944 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 05:34:28,000 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 05:34:28,028 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 05:34:28,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 05:34:28,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:28,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-20 05:34:28,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-20 05:34:28,086 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 05:34:28,093 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 05:34:28,099 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23c03aeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 05:34:28,100 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-20 05:34:28,219 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:28,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 661051282, now seen corresponding path program 1 times [2025-03-20 05:34:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788280211] [2025-03-20 05:34:28,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:28,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-20 05:34:28,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-20 05:34:28,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:28,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788280211] [2025-03-20 05:34:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788280211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:34:28,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:34:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 05:34:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798979307] [2025-03-20 05:34:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:34:28,355 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 05:34:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:28,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 05:34:28,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 05:34:28,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,368 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:28,369 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 05:34:28,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,436 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 05:34:28,436 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:28,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1024921621, now seen corresponding path program 1 times [2025-03-20 05:34:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011356436] [2025-03-20 05:34:28,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:28,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 05:34:28,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 05:34:28,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:28,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011356436] [2025-03-20 05:34:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011356436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:34:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:34:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 05:34:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636584356] [2025-03-20 05:34:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:34:28,574 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 05:34:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:28,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 05:34:28,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 05:34:28,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,575 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:28,575 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-03-20 05:34:28,575 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,575 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:28,694 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-20 05:34:28,695 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:28,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash -404364622, now seen corresponding path program 1 times [2025-03-20 05:34:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418491698] [2025-03-20 05:34:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:28,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-20 05:34:28,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-20 05:34:28,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:28,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:28,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:28,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418491698] [2025-03-20 05:34:28,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418491698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:34:28,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:34:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 05:34:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984498776] [2025-03-20 05:34:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:34:28,864 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 05:34:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:28,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 05:34:28,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 05:34:28,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,865 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:28,865 INFO L481 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-03-20 05:34:28,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:28,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:28,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:28,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:28,921 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-20 05:34:28,921 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:28,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1777118079, now seen corresponding path program 1 times [2025-03-20 05:34:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376362593] [2025-03-20 05:34:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:28,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-20 05:34:28,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-20 05:34:28,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:28,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376362593] [2025-03-20 05:34:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376362593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 05:34:29,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554825137] [2025-03-20 05:34:29,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:29,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:34:29,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-20 05:34:29,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-20 05:34:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-20 05:34:29,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:29,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:29,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-20 05:34:29,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:34:29,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-20 05:34:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:30,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:34:30,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-03-20 05:34:30,470 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 05:34:30,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-03-20 05:34:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554825137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:34:30,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 05:34:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-20 05:34:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952087177] [2025-03-20 05:34:30,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 05:34:30,573 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-20 05:34:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-20 05:34:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-20 05:34:30,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:30,573 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:30,574 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 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-03-20 05:34:30,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:30,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:30,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:30,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:30,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:30,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:30,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:30,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:30,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-20 05:34:31,046 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:31,046 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:31,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1144440287, now seen corresponding path program 2 times [2025-03-20 05:34:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137728326] [2025-03-20 05:34:31,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 05:34:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:31,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-20 05:34:31,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-20 05:34:31,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 05:34:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 05:34:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137728326] [2025-03-20 05:34:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137728326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:34:31,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:34:31,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-20 05:34:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379747245] [2025-03-20 05:34:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:34:31,185 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-20 05:34:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:31,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-20 05:34:31,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-20 05:34:31,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,185 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:31,185 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-03-20 05:34:31,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:31,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:31,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:31,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:31,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:31,253 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-20 05:34:31,253 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:31,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 547060534, now seen corresponding path program 3 times [2025-03-20 05:34:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762801125] [2025-03-20 05:34:31,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 05:34:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:31,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-20 05:34:31,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 32 statements. [2025-03-20 05:34:31,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-20 05:34:31,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 05:34:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762801125] [2025-03-20 05:34:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762801125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 05:34:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056149084] [2025-03-20 05:34:31,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 05:34:31,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:31,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:31,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:34:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-20 05:34:31,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-20 05:34:31,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 32 statements. [2025-03-20 05:34:31,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-20 05:34:31,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:31,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-20 05:34:31,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:34:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 05:34:31,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:34:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 05:34:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056149084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:34:31,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 05:34:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-20 05:34:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675005154] [2025-03-20 05:34:31,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 05:34:31,483 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 05:34:31,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:31,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 05:34:31,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-20 05:34:31,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,484 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:31,484 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 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-03-20 05:34:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:31,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:31,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:31,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-20 05:34:31,768 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:31,770 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:31,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1569287031, now seen corresponding path program 4 times [2025-03-20 05:34:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541978534] [2025-03-20 05:34:31,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 05:34:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:31,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-20 05:34:31,799 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-20 05:34:31,803 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 05:34:31,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 05:34:31,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:31,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541978534] [2025-03-20 05:34:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541978534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:34:31,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:34:31,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 05:34:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116292116] [2025-03-20 05:34:31,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:34:31,899 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 05:34:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:31,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 05:34:31,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 05:34:31,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,900 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:31,901 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:31,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:31,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:31,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:31,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:31,996 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-20 05:34:31,996 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:31,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1925524375, now seen corresponding path program 1 times [2025-03-20 05:34:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:31,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060312058] [2025-03-20 05:34:31,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:32,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-20 05:34:32,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-20 05:34:32,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:32,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060312058] [2025-03-20 05:34:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060312058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 05:34:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699690237] [2025-03-20 05:34:33,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:34:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:33,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:33,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:34:33,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-20 05:34:33,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-20 05:34:33,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-20 05:34:33,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:34:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:33,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-20 05:34:33,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:34:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 05:34:33,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:34:33,607 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 05:34:33,608 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-20 05:34:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 05:34:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699690237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:34:33,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 05:34:33,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 23 [2025-03-20 05:34:33,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682458379] [2025-03-20 05:34:33,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 05:34:33,708 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-20 05:34:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:33,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-20 05:34:33,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2025-03-20 05:34:33,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:33,708 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:33,709 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 23 states have internal predecessors, (99), 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-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:33,709 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 05:34:34,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-20 05:34:34,265 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:34,265 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:34,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash -859342709, now seen corresponding path program 2 times [2025-03-20 05:34:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096834791] [2025-03-20 05:34:34,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 05:34:34,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:34,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-20 05:34:34,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 05:34:34,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 05:34:34,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 05:34:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:34,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096834791] [2025-03-20 05:34:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096834791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 05:34:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346759797] [2025-03-20 05:34:34,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 05:34:34,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:34,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:34,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:34:34,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-20 05:34:34,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-20 05:34:34,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 05:34:34,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 05:34:34,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:34,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 05:34:34,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:34:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 05:34:34,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:34:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 05:34:34,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346759797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:34:34,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 05:34:34,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 10 [2025-03-20 05:34:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333248919] [2025-03-20 05:34:34,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 05:34:34,566 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-20 05:34:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:34,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-20 05:34:34,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-20 05:34:34,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:34,567 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:34,567 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 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-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 05:34:34,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 05:34:34,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:34,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-20 05:34:34,893 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-20 05:34:34,893 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:34,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2097442834, now seen corresponding path program 3 times [2025-03-20 05:34:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784635169] [2025-03-20 05:34:34,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 05:34:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:34,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-20 05:34:34,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-20 05:34:34,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-20 05:34:34,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 05:34:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784635169] [2025-03-20 05:34:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784635169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 05:34:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406985954] [2025-03-20 05:34:35,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 05:34:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:35,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:35,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:34:35,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-20 05:34:35,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-20 05:34:35,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-20 05:34:35,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-20 05:34:35,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:35,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-20 05:34:35,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:34:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 05:34:35,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:34:35,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 05:34:35,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-03-20 05:34:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 05:34:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406985954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:34:36,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 05:34:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2025-03-20 05:34:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996313856] [2025-03-20 05:34:36,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 05:34:36,050 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-20 05:34:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 05:34:36,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-20 05:34:36,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-20 05:34:36,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:36,051 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:34:36,051 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.84) internal successors, (121), 24 states have internal predecessors, (121), 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-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:36,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:36,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:34:36,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 05:34:36,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:36,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 05:34:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:34:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 05:34:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 05:34:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-20 05:34:36,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-20 05:34:36,806 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-20 05:34:36,806 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:34:36,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:34:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1750308662, now seen corresponding path program 4 times [2025-03-20 05:34:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 05:34:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554919258] [2025-03-20 05:34:36,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 05:34:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 05:34:36,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-20 05:34:36,836 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-20 05:34:36,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 05:34:36,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 05:34:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554919258] [2025-03-20 05:34:37,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554919258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 05:34:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350420041] [2025-03-20 05:34:37,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 05:34:37,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:34:37,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:34:37,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:34:37,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-20 05:34:37,757 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-20 05:34:37,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-20 05:34:37,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 05:34:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:34:37,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-20 05:34:37,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:34:37,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-20 05:34:38,780 INFO L325 Elim1Store]: treesize reduction 184, result has 6.6 percent of original size [2025-03-20 05:34:38,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 36 [2025-03-20 05:34:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:34:38,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:34:41,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 248 [2025-03-20 05:34:41,784 INFO L325 Elim1Store]: treesize reduction 30, result has 93.1 percent of original size [2025-03-20 05:34:41,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1197 treesize of output 1174 [2025-03-20 05:38:03,489 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:03,748 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:06,059 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:06,187 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:07,039 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:07,326 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:07,609 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:07,712 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:07,979 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:08,099 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:08,264 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:08,449 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:08,557 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:08,631 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:09,776 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:38:09,966 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:10,239 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:38:10,454 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:10,670 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:10,886 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:11,076 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:11,270 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:11,495 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:11,699 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:11,853 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:12,033 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:12,294 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:12,422 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:12,516 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:12,574 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:12,648 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:12,727 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:12,772 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:12,944 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:13,187 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:13,456 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:13,629 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:14,003 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:14,166 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:14,436 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:14,912 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:16,875 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:21,701 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:22,613 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:23,924 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:24,896 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:29,183 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:34,023 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:35,486 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:36,683 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:37,303 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:37,920 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:38,778 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:39,575 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:39,833 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:40,306 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:40,813 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:41,405 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:42,308 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:45,293 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:45,823 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:46,115 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:46,740 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:47,006 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:47,524 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:47,635 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:48,078 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:48,507 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:48,832 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:49,132 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:38:49,567 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:50,017 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:50,317 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:38:50,936 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:51,242 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:51,297 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:51,425 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:51,499 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:51,630 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:52,501 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:53,058 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:53,324 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:54,005 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:54,734 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:55,341 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:55,878 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:56,486 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:38:57,126 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:57,850 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:38:59,501 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 05:39:00,221 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:00,912 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 05:39:01,646 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:02,165 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:02,844 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:03,390 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:03,852 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:04,318 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:04,579 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:05,554 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:06,249 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:06,564 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:06,839 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:06,978 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:07,309 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:07,590 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:07,689 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:07,926 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:08,287 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:08,583 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:08,965 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:09,272 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:09,452 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:09,559 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:09,630 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:09,815 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:09,893 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:10,115 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:10,210 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:10,419 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:11,371 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:12,213 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:13,162 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:14,057 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:14,741 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:15,089 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:15,815 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:16,191 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:16,770 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:17,208 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:17,785 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:18,281 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:18,925 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:22,320 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:22,480 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:23,040 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:23,234 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:24,042 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:24,206 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:24,267 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:24,598 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:24,928 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:25,742 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:26,079 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:27,019 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:27,844 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:28,465 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:28,542 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:28,630 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:29,684 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:31,697 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:31,850 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:32,264 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:32,559 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:33,093 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:36,169 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:36,543 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:37,229 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:37,735 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:37,821 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:38,150 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:38,664 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:39,205 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:39,716 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:40,036 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:40,563 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:42,040 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:42,692 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:42,784 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:42,999 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:44,840 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:46,104 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:48,175 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:49,863 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:50,048 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:50,196 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:50,744 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:51,136 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:51,291 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:51,537 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:51,836 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:39:52,373 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:52,581 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:53,031 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:55,840 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:57,632 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:57,805 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:57,952 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:58,476 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:58,856 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:59,003 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:39:59,200 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:39:59,541 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:00,059 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:00,270 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:00,700 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:03,738 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:05,434 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:05,673 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:05,823 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:06,377 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:06,764 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:06,918 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:07,122 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:07,426 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:08,022 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:08,227 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:08,665 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:11,653 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:13,444 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:13,635 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:13,790 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:14,400 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:14,806 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:14,961 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:15,166 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:15,471 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:16,081 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:16,303 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:16,759 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:19,036 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:19,207 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:19,536 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:20,063 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:21,466 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:22,967 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:23,211 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:23,356 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:23,652 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:24,200 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:24,635 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:25,183 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:25,364 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:25,438 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:26,842 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:27,385 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:27,474 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:27,719 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:32,334 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:34,348 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:34,728 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:34,964 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:35,575 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:35,750 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:36,099 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:36,438 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:36,581 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:37,009 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 05:40:37,883 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:38,210 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:38,505 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:38,981 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:39,088 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:39,448 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:39,660 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:39,741 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:39,829 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:40,072 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:40,410 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:41,004 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:41,700 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:42,878 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:43,161 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:43,590 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:43,976 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:44,867 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:45,429 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:45,695 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:46,029 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:47,815 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:48,425 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:49,607 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:50,992 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:51,117 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:51,565 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:52,035 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:52,415 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:52,885 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:40:53,497 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:54,064 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:55,659 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:56,199 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:56,872 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:57,000 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:57,080 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:57,753 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:40:58,411 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:40:59,663 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:01,224 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:01,355 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:01,836 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:02,265 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:02,661 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:03,163 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:41:03,869 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:04,466 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:06,155 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:06,717 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:07,391 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:07,526 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:07,611 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:08,313 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:08,985 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:10,264 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:11,891 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:12,029 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:12,521 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:12,968 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:13,439 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:13,953 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:41:14,635 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:15,275 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:17,033 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:17,620 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:18,369 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:18,505 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:18,596 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:19,402 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:20,105 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:21,439 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:23,101 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:23,239 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:23,721 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:24,161 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:24,577 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:25,095 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:41:25,801 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:26,425 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:28,191 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:28,767 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:29,457 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:29,590 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:29,677 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:33,141 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:35,809 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:38,674 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:41,370 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:49,838 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:50,081 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:50,198 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:50,780 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:51,126 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:51,295 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:41:52,118 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 05:41:52,591 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:53,020 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:53,332 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:53,801 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:54,129 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:54,669 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:55,006 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:56,033 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:56,381 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:56,764 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:56,930 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:57,518 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:57,789 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:57,876 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:58,140 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:41:58,708 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:41:59,470 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:03,877 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:04,010 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:04,823 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:42:04,932 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:05,258 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 05:42:05,373 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:06,681 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:07,097 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 05:42:07,501 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-20 05:42:07,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2025-03-20 05:42:07,502 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-20 05:42:07,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-20 05:42:07,702 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-20 05:42:07,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-03-20 05:42:07,709 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 70 more [2025-03-20 05:42:07,714 INFO L158 Benchmark]: Toolchain (without parser) took 460430.01ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 92.6MB in the beginning and 908.6MB in the end (delta: -816.0MB). Peak memory consumption was 935.8MB. Max. memory is 16.1GB. [2025-03-20 05:42:07,714 INFO L158 Benchmark]: CDTParser took 2.10ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 05:42:07,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.39ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 77.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-20 05:42:07,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 76.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 05:42:07,714 INFO L158 Benchmark]: Boogie Preprocessor took 31.10ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 75.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 05:42:07,715 INFO L158 Benchmark]: RCFGBuilder took 406.13ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 40.9MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-20 05:42:07,715 INFO L158 Benchmark]: TraceAbstraction took 459788.48ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 40.3MB in the beginning and 908.6MB in the end (delta: -868.3MB). Peak memory consumption was 885.5MB. Max. memory is 16.1GB. [2025-03-20 05:42:07,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.10ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.39ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 77.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 76.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.10ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 75.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 406.13ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 40.9MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 459788.48ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 40.3MB in the beginning and 908.6MB in the end (delta: -868.3MB). Peak memory consumption was 885.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 05:42:09,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 05:42:09,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-03-20 05:42:09,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 05:42:09,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 05:42:09,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 05:42:09,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 05:42:09,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 05:42:09,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 05:42:09,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 05:42:09,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 05:42:09,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 05:42:09,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 05:42:09,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 05:42:09,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 05:42:09,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 05:42:09,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 05:42:09,267 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-20 05:42:09,268 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 05:42:09,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-20 05:42:09,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 05:42:09,268 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 05:42:09,268 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 05:42:09,268 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/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 -> d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 05:42:09,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 05:42:09,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 05:42:09,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 05:42:09,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 05:42:09,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 05:42:09,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-20 05:42:10,733 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d7d0319ae/8564d8c171524faf9cad714884e65124/FLAG6420fd4f7 [2025-03-20 05:42:10,909 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 05:42:10,912 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-20 05:42:10,917 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d7d0319ae/8564d8c171524faf9cad714884e65124/FLAG6420fd4f7 [2025-03-20 05:42:11,784 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d7d0319ae/8564d8c171524faf9cad714884e65124 [2025-03-20 05:42:11,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 05:42:11,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 05:42:11,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 05:42:11,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 05:42:11,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 05:42:11,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:11,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d338214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11, skipping insertion in model container [2025-03-20 05:42:11,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:11,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 05:42:11,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-20 05:42:11,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 05:42:11,942 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 05:42:11,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-20 05:42:11,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 05:42:11,972 INFO L204 MainTranslator]: Completed translation [2025-03-20 05:42:11,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11 WrapperNode [2025-03-20 05:42:11,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 05:42:11,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 05:42:11,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 05:42:11,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 05:42:11,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:11,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:11,994 INFO L138 Inliner]: procedures = 25, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 131 [2025-03-20 05:42:11,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 05:42:11,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 05:42:11,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 05:42:11,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 05:42:12,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 05:42:12,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 05:42:12,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 05:42:12,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 05:42:12,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (1/1) ... [2025-03-20 05:42:12,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 05:42:12,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:12,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 05:42:12,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 05:42:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-20 05:42:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-20 05:42:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 05:42:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 05:42:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-20 05:42:12,072 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 05:42:12,151 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 05:42:12,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 05:42:12,338 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 05:42:12,338 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 05:42:12,455 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 05:42:12,455 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-20 05:42:12,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:42:12 BoogieIcfgContainer [2025-03-20 05:42:12,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 05:42:12,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 05:42:12,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 05:42:12,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 05:42:12,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 05:42:11" (1/3) ... [2025-03-20 05:42:12,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c12e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:42:12, skipping insertion in model container [2025-03-20 05:42:12,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:42:11" (2/3) ... [2025-03-20 05:42:12,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c12e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:42:12, skipping insertion in model container [2025-03-20 05:42:12,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:42:12" (3/3) ... [2025-03-20 05:42:12,462 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-03-20 05:42:12,484 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 05:42:12,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 27 locations, 30 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-20 05:42:12,486 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 05:42:12,522 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 05:42:12,550 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 05:42:12,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 05:42:12,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:12,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-20 05:42:12,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-20 05:42:12,603 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 05:42:12,611 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 05:42:12,619 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f175895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 05:42:12,619 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-20 05:42:12,727 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:42:12,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:42:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -462799026, now seen corresponding path program 1 times [2025-03-20 05:42:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 05:42:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214615159] [2025-03-20 05:42:12,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:42:12,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:12,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:12,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:42:12,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-20 05:42:12,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-20 05:42:12,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-20 05:42:12,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:42:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:42:12,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-20 05:42:12,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:42:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:12,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 05:42:12,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 05:42:12,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214615159] [2025-03-20 05:42:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214615159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:42:12,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:42:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 05:42:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196090434] [2025-03-20 05:42:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:42:12,846 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 05:42:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 05:42:12,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 05:42:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 05:42:12,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:12,860 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:42:12,861 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 05:42:12,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:12,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:12,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-20 05:42:13,152 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:13,152 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:42:13,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:42:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1285185751, now seen corresponding path program 1 times [2025-03-20 05:42:13,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 05:42:13,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229443195] [2025-03-20 05:42:13,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:42:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:13,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:13,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:42:13,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-20 05:42:13,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 05:42:13,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 05:42:13,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:42:13,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:42:13,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-20 05:42:13,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:42:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:13,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 05:42:13,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 05:42:13,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229443195] [2025-03-20 05:42:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229443195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 05:42:13,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 05:42:13,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 05:42:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293759863] [2025-03-20 05:42:13,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 05:42:13,280 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 05:42:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 05:42:13,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 05:42:13,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 05:42:13,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:13,281 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:42:13,281 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-03-20 05:42:13,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:13,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:13,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:13,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:13,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-20 05:42:13,546 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:13,546 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:42:13,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:42:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1475646846, now seen corresponding path program 1 times [2025-03-20 05:42:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 05:42:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408277876] [2025-03-20 05:42:13,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:42:13,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:13,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:13,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:42:13,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-20 05:42:13,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-20 05:42:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-20 05:42:13,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:42:13,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:42:13,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-20 05:42:13,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:42:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:13,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:42:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:13,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 05:42:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408277876] [2025-03-20 05:42:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408277876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:42:13,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-20 05:42:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-20 05:42:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642257940] [2025-03-20 05:42:13,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-20 05:42:13,893 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 05:42:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 05:42:13,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 05:42:13,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-20 05:42:13,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:13,894 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:42:13,895 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 05:42:13,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:13,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:13,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:14,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:14,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:14,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 05:42:14,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-20 05:42:14,334 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:14,334 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:42:14,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:42:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 847262862, now seen corresponding path program 1 times [2025-03-20 05:42:14,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 05:42:14,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480993184] [2025-03-20 05:42:14,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 05:42:14,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:14,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:14,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:42:14,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-20 05:42:14,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-20 05:42:14,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-20 05:42:14,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 05:42:14,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:42:14,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-20 05:42:14,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:42:14,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-20 05:42:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:14,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:42:15,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2025-03-20 05:42:15,464 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 05:42:15,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 98 [2025-03-20 05:42:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:16,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 05:42:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480993184] [2025-03-20 05:42:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480993184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:42:16,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-20 05:42:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-20 05:42:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984938472] [2025-03-20 05:42:16,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-20 05:42:16,218 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-20 05:42:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 05:42:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-20 05:42:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-20 05:42:16,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:16,219 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:42:16,220 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 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-03-20 05:42:16,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:16,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:16,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 05:42:16,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:17,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:17,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:17,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 05:42:17,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 05:42:18,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-20 05:42:18,194 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:18,195 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:42:18,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:42:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1939136946, now seen corresponding path program 2 times [2025-03-20 05:42:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 05:42:18,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870117144] [2025-03-20 05:42:18,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 05:42:18,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:18,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:42:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-20 05:42:18,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-20 05:42:18,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-20 05:42:18,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 05:42:18,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 05:42:18,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-20 05:42:18,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 05:42:18,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-20 05:42:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:18,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 05:42:19,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2025-03-20 05:42:19,361 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 05:42:19,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 98 [2025-03-20 05:42:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 05:42:21,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 05:42:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870117144] [2025-03-20 05:42:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870117144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 05:42:21,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-20 05:42:21,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-20 05:42:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46142544] [2025-03-20 05:42:21,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-20 05:42:21,897 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-20 05:42:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 05:42:21,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-20 05:42:21,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-03-20 05:42:21,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:21,898 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 05:42:21,899 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 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-03-20 05:42:21,899 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:21,899 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:21,899 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 05:42:21,899 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 05:42:21,899 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:29,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 05:42:29,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 05:42:29,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 05:42:29,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 05:42:29,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 05:42:29,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-20 05:42:30,147 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:30,147 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 05:42:30,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 05:42:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 194007502, now seen corresponding path program 3 times [2025-03-20 05:42:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 05:42:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294793873] [2025-03-20 05:42:30,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 05:42:30,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 05:42:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 05:42:30,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 05:42:30,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-20 05:42:30,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 8 equivalence classes. Killed by 15