./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.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-bad-counter-queue.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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --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 03:53:02,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 03:53:02,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 03:53:02,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 03:53:02,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 03:53:02,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 03:53:02,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 03:53:02,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 03:53:02,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 03:53:02,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 03:53:02,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 03:53:02,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 03:53:02,142 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 03:53:02,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 03:53:02,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 03:53:02,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 03:53:02,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 03:53:02,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 03:53:02,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 03:53:02,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 03:53:02,144 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 03:53:02,144 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 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 03:53:02,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 03:53:02,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 03:53:02,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 03:53:02,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 03:53:02,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 03:53:02,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-20 03:53:03,623 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e58c68978/dd5b6cf6e3a34a5c9a92c9c2de11c5aa/FLAG4e0980e3f [2025-03-20 03:53:03,758 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 03:53:03,758 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-20 03:53:03,765 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e58c68978/dd5b6cf6e3a34a5c9a92c9c2de11c5aa/FLAG4e0980e3f [2025-03-20 03:53:04,824 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e58c68978/dd5b6cf6e3a34a5c9a92c9c2de11c5aa [2025-03-20 03:53:04,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 03:53:04,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 03:53:04,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 03:53:04,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 03:53:04,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 03:53:04,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:53:04" (1/1) ... [2025-03-20 03:53:04,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db2351a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:04, skipping insertion in model container [2025-03-20 03:53:04,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:53:04" (1/1) ... [2025-03-20 03:53:04,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 03:53:04,965 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-bad-counter-queue.wvr.c[2142,2155] [2025-03-20 03:53:04,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 03:53:04,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 03:53:05,004 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-bad-counter-queue.wvr.c[2142,2155] [2025-03-20 03:53:05,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 03:53:05,029 INFO L204 MainTranslator]: Completed translation [2025-03-20 03:53:05,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05 WrapperNode [2025-03-20 03:53:05,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 03:53:05,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 03:53:05,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 03:53:05,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 03:53:05,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,061 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-03-20 03:53:05,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 03:53:05,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 03:53:05,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 03:53:05,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 03:53:05,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 03:53:05,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 03:53:05,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 03:53:05,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 03:53:05,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (1/1) ... [2025-03-20 03:53:05,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 03:53:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:05,118 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 03:53:05,121 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 03:53:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 03:53:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-20 03:53:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-20 03:53:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-20 03:53:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-20 03:53:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 03:53:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-20 03:53:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-20 03:53:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 03:53:05,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 03:53:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-20 03:53:05,141 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 03:53:05,218 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 03:53:05,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 03:53:05,422 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 03:53:05,423 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 03:53:05,565 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 03:53:05,565 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-20 03:53:05,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:53:05 BoogieIcfgContainer [2025-03-20 03:53:05,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 03:53:05,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 03:53:05,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 03:53:05,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 03:53:05,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 03:53:04" (1/3) ... [2025-03-20 03:53:05,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22902afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:53:05, skipping insertion in model container [2025-03-20 03:53:05,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:53:05" (2/3) ... [2025-03-20 03:53:05,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22902afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:53:05, skipping insertion in model container [2025-03-20 03:53:05,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:53:05" (3/3) ... [2025-03-20 03:53:05,573 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-03-20 03:53:05,582 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 03:53:05,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 22 locations, 22 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-20 03:53:05,584 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 03:53:05,617 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 03:53:05,652 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 03:53:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 03:53:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:05,655 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 03:53:05,657 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 03:53:05,718 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 03:53:05,727 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 03:53:05,733 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;@399668cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 03:53:05,733 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-20 03:53:05,916 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 03:53:05,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1700806888, now seen corresponding path program 1 times [2025-03-20 03:53:05,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:05,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743838124] [2025-03-20 03:53:05,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:05,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-20 03:53:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-20 03:53:05,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:05,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:06,099 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 03:53:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743838124] [2025-03-20 03:53:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743838124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 03:53:06,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 03:53:06,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 03:53:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35203273] [2025-03-20 03:53:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 03:53:06,104 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 03:53:06,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:06,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 03:53:06,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 03:53:06,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:06,120 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:06,121 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 03:53:06,121 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:06,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:06,164 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 03:53:06,165 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 03:53:06,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash -404550123, now seen corresponding path program 1 times [2025-03-20 03:53:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370902943] [2025-03-20 03:53:06,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:06,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-20 03:53:06,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-20 03:53:06,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:06,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:06,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370902943] [2025-03-20 03:53:06,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370902943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 03:53:06,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 03:53:06,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 03:53:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395910340] [2025-03-20 03:53:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 03:53:06,347 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 03:53:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:06,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 03:53:06,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-20 03:53:06,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:06,348 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:06,349 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 03:53:06,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:06,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:06,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:06,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:06,382 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-20 03:53:06,382 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 03:53:06,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2137194699, now seen corresponding path program 1 times [2025-03-20 03:53:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819098297] [2025-03-20 03:53:06,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 03:53:06,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 03:53:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 03:53:06,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:06,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819098297] [2025-03-20 03:53:06,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819098297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:06,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570227696] [2025-03-20 03:53:06,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:06,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:06,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:06,495 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 03:53:06,496 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 03:53:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 03:53:06,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 03:53:06,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:06,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:06,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 03:53:06,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 03:53:06,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 03:53:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570227696] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-20 03:53:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-20 03:53:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317385168] [2025-03-20 03:53:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 03:53:06,631 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 03:53:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 03:53:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-20 03:53:06,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:06,632 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:06,632 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 03:53:06,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:06,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:06,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:06,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:06,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:06,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:06,715 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 03:53:06,909 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,SelfDestructingSolverStorable2 [2025-03-20 03:53:06,910 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 03:53:06,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -585821194, now seen corresponding path program 1 times [2025-03-20 03:53:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058977227] [2025-03-20 03:53:06,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:06,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 03:53:06,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 03:53:06,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:06,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:07,024 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 03:53:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058977227] [2025-03-20 03:53:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058977227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909968025] [2025-03-20 03:53:07,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:07,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:07,026 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 03:53:07,029 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 03:53:07,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 03:53:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 03:53:07,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:07,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:07,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 03:53:07,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:07,125 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 03:53:07,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:07,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909968025] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:07,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-20 03:53:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-20 03:53:07,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580092848] [2025-03-20 03:53:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 03:53:07,162 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 03:53:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:07,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 03:53:07,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-20 03:53:07,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:07,163 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:07,164 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 03:53:07,164 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:07,164 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:07,164 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:07,164 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:07,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:07,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:07,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:07,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:07,244 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 03:53:07,438 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:07,438 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 03:53:07,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -361397645, now seen corresponding path program 1 times [2025-03-20 03:53:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:07,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816088546] [2025-03-20 03:53:07,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:07,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 03:53:07,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 03:53:07,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:07,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816088546] [2025-03-20 03:53:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816088546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094279210] [2025-03-20 03:53:07,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 03:53:07,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:07,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:07,916 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 03:53:07,918 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 03:53:07,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 03:53:07,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 03:53:07,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:07,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:07,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-20 03:53:07,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 03:53:08,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:08,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 03:53:08,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 14 [2025-03-20 03:53:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 03:53:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094279210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:08,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:08,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2025-03-20 03:53:08,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083658988] [2025-03-20 03:53:08,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:08,166 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-20 03:53:08,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:08,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-20 03:53:08,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-20 03:53:08,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:08,166 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:08,167 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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 03:53:08,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:08,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:08,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:08,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:08,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:08,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:08,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:08,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:08,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:08,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:08,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-20 03:53:08,667 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:08,667 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 03:53:08,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1690028250, now seen corresponding path program 2 times [2025-03-20 03:53:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899478648] [2025-03-20 03:53:08,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 03:53:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:08,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-20 03:53:08,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-20 03:53:08,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 03:53:08,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 03:53:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899478648] [2025-03-20 03:53:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899478648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434760428] [2025-03-20 03:53:08,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 03:53:08,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:08,770 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 03:53:08,772 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 03:53:08,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-20 03:53:08,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-20 03:53:08,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 03:53:08,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:08,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-20 03:53:08,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:08,892 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 03:53:08,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:08,942 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 03:53:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434760428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:08,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-20 03:53:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939898596] [2025-03-20 03:53:08,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:08,944 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-20 03:53:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:08,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-20 03:53:08,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-20 03:53:08,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:08,945 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:08,945 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 03:53:08,945 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:08,945 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:08,945 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:08,945 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:08,945 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:08,945 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:09,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:09,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:09,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:09,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:09,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:09,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:09,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-20 03:53:09,265 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,SelfDestructingSolverStorable5 [2025-03-20 03:53:09,266 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 03:53:09,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:09,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1916901253, now seen corresponding path program 3 times [2025-03-20 03:53:09,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242913301] [2025-03-20 03:53:09,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 03:53:09,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:09,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-20 03:53:09,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-20 03:53:09,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-20 03:53:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:09,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242913301] [2025-03-20 03:53:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242913301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636160994] [2025-03-20 03:53:09,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 03:53:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:09,373 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 03:53:09,375 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 03:53:09,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-20 03:53:09,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-20 03:53:09,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-20 03:53:09,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:09,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-20 03:53:09,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:09,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:09,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636160994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:09,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:09,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-20 03:53:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995575880] [2025-03-20 03:53:09,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:09,544 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-20 03:53:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:09,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-20 03:53:09,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-20 03:53:09,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:09,545 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:09,545 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 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 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:09,545 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:09,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:09,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:09,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:09,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:09,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:09,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:09,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:09,651 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 03:53:09,845 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:09,846 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 03:53:09,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash 865608654, now seen corresponding path program 4 times [2025-03-20 03:53:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:09,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720805235] [2025-03-20 03:53:09,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 03:53:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:09,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-20 03:53:09,868 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-20 03:53:09,868 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 03:53:09,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720805235] [2025-03-20 03:53:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720805235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546694076] [2025-03-20 03:53:10,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 03:53:10,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:10,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:10,503 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 03:53:10,505 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 03:53:10,538 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-20 03:53:10,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-20 03:53:10,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 03:53:10,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:10,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-20 03:53:10,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 03:53:10,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:11,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 03:53:11,015 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 42 treesize of output 45 [2025-03-20 03:53:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 03:53:11,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546694076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:11,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:11,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 36 [2025-03-20 03:53:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361103264] [2025-03-20 03:53:11,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:11,093 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-20 03:53:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:11,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-20 03:53:11,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2025-03-20 03:53:11,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:11,094 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:11,094 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 03:53:11,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:11,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:11,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:11,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:11,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:11,095 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:11,095 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:11,095 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:12,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:12,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-20 03:53:12,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-20 03:53:12,211 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,SelfDestructingSolverStorable7 [2025-03-20 03:53:12,212 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 03:53:12,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 968025503, now seen corresponding path program 5 times [2025-03-20 03:53:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208281916] [2025-03-20 03:53:12,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 03:53:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:12,219 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 3 equivalence classes. [2025-03-20 03:53:12,231 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-20 03:53:12,231 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-20 03:53:12,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-20 03:53:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208281916] [2025-03-20 03:53:12,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208281916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 03:53:12,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 03:53:12,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-20 03:53:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619520584] [2025-03-20 03:53:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 03:53:12,288 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-20 03:53:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:12,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-20 03:53:12,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-20 03:53:12,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:12,289 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:12,290 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-03-20 03:53:12,290 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:12,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:12,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:12,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:12,404 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-20 03:53:12,404 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 03:53:12,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1775568288, now seen corresponding path program 6 times [2025-03-20 03:53:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075170889] [2025-03-20 03:53:12,404 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 03:53:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:12,411 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 3 equivalence classes. [2025-03-20 03:53:12,429 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-20 03:53:12,429 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-20 03:53:12,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075170889] [2025-03-20 03:53:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075170889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372676987] [2025-03-20 03:53:12,510 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 03:53:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:12,512 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:12,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-20 03:53:12,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 3 equivalence classes. [2025-03-20 03:53:12,573 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-20 03:53:12,573 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-20 03:53:12,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:12,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-20 03:53:12,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:12,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372676987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:12,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-20 03:53:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284819043] [2025-03-20 03:53:12,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:12,749 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-20 03:53:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:12,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-20 03:53:12,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-20 03:53:12,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:12,749 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:12,749 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 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 03:53:12,749 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:12,749 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:12,750 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:12,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:12,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:12,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:12,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-20 03:53:13,018 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:13,018 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 03:53:13,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1046973568, now seen corresponding path program 7 times [2025-03-20 03:53:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066499816] [2025-03-20 03:53:13,019 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 03:53:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:13,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-20 03:53:13,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-20 03:53:13,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066499816] [2025-03-20 03:53:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066499816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297285752] [2025-03-20 03:53:13,127 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 03:53:13,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:13,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:13,128 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:13,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-20 03:53:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-20 03:53:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-20 03:53:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:13,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-20 03:53:13,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:13,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:13,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297285752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:13,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-20 03:53:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855042506] [2025-03-20 03:53:13,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:13,356 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-20 03:53:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:13,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-20 03:53:13,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-20 03:53:13,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:13,357 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:13,357 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:13,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:13,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:13,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-20 03:53:13,686 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:13,686 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:53:13,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -342889051, now seen corresponding path program 8 times [2025-03-20 03:53:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397120328] [2025-03-20 03:53:13,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 03:53:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:13,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-20 03:53:13,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-20 03:53:13,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 03:53:13,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:13,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397120328] [2025-03-20 03:53:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397120328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049538148] [2025-03-20 03:53:13,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 03:53:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:13,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:13,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-20 03:53:13,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-20 03:53:13,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-20 03:53:13,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 03:53:13,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:13,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-20 03:53:13,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:14,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049538148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:14,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-20 03:53:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940992341] [2025-03-20 03:53:14,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:14,097 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-20 03:53:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:14,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-20 03:53:14,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-20 03:53:14,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:14,097 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:14,098 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 23 states have internal predecessors, (78), 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 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:14,098 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:14,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:14,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-20 03:53:14,377 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-20 03:53:14,377 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:53:14,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash -438439803, now seen corresponding path program 9 times [2025-03-20 03:53:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072551461] [2025-03-20 03:53:14,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 03:53:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:14,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-03-20 03:53:14,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-20 03:53:14,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-20 03:53:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072551461] [2025-03-20 03:53:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072551461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495674874] [2025-03-20 03:53:14,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 03:53:14,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:14,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:14,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:14,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-20 03:53:14,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-03-20 03:53:14,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-20 03:53:14,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-20 03:53:14,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:14,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-20 03:53:14,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:14,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495674874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:14,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-20 03:53:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060060865] [2025-03-20 03:53:14,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:14,840 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-20 03:53:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-20 03:53:14,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-03-20 03:53:14,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:14,841 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:14,841 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 23 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 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:14,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:14,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:14,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-20 03:53:15,176 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:15,176 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:53:15,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 821045124, now seen corresponding path program 10 times [2025-03-20 03:53:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358626112] [2025-03-20 03:53:15,177 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 03:53:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:15,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-20 03:53:15,232 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-20 03:53:15,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 03:53:15,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358626112] [2025-03-20 03:53:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358626112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043972850] [2025-03-20 03:53:17,016 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 03:53:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:17,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:17,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-20 03:53:17,061 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-20 03:53:17,082 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-20 03:53:17,082 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 03:53:17,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:17,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-20 03:53:17,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 03:53:17,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:18,931 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 03:53:18,931 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 82 treesize of output 165 [2025-03-20 03:53:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 03:53:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043972850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:19,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 25] total 75 [2025-03-20 03:53:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486172901] [2025-03-20 03:53:19,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:19,334 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-20 03:53:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:19,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-20 03:53:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=5450, Unknown=0, NotChecked=0, Total=5700 [2025-03-20 03:53:19,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:19,337 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:19,337 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.25) internal successors, (95), 75 states have internal predecessors, (95), 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 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:19,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:19,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:19,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:19,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:19,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:19,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:22,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:22,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:22,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-20 03:53:22,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-20 03:53:22,880 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-20 03:53:22,880 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:53:22,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1797925878, now seen corresponding path program 11 times [2025-03-20 03:53:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728105313] [2025-03-20 03:53:22,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 03:53:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:22,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 5 equivalence classes. [2025-03-20 03:53:22,900 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-03-20 03:53:22,900 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-20 03:53:22,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 03:53:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728105313] [2025-03-20 03:53:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728105313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218169793] [2025-03-20 03:53:22,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 03:53:22,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:22,978 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:22,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-20 03:53:23,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 5 equivalence classes. [2025-03-20 03:53:23,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-03-20 03:53:23,046 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-20 03:53:23,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:23,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-20 03:53:23,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:23,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218169793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:23,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 26 [2025-03-20 03:53:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749257839] [2025-03-20 03:53:23,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:23,332 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-20 03:53:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:23,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-20 03:53:23,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2025-03-20 03:53:23,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:23,332 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:23,332 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2025-03-20 03:53:23,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:24,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:53:24,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:53:24,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-20 03:53:24,390 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-20 03:53:24,390 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:53:24,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1963869904, now seen corresponding path program 12 times [2025-03-20 03:53:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462804781] [2025-03-20 03:53:24,390 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 03:53:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:24,398 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 9 equivalence classes. [2025-03-20 03:53:24,471 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 67 of 67 statements. [2025-03-20 03:53:24,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-20 03:53:24,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 145 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-20 03:53:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462804781] [2025-03-20 03:53:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462804781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130401737] [2025-03-20 03:53:24,657 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 03:53:24,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:24,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:24,659 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:24,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-20 03:53:24,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 9 equivalence classes. [2025-03-20 03:53:24,816 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 67 of 67 statements. [2025-03-20 03:53:24,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-20 03:53:24,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:24,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-20 03:53:24,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 176 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:25,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 176 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:25,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130401737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:25,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 43 [2025-03-20 03:53:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48874829] [2025-03-20 03:53:25,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:25,271 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-20 03:53:25,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:25,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-20 03:53:25,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1476, Unknown=0, NotChecked=0, Total=1892 [2025-03-20 03:53:25,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:25,272 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:25,272 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.8863636363636362) internal successors, (171), 43 states have internal predecessors, (171), 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 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:53:25,272 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:25,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:25,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:53:25,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:53:25,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-20 03:53:25,538 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-20 03:53:25,538 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:53:25,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:53:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1470434288, now seen corresponding path program 13 times [2025-03-20 03:53:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:53:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971841775] [2025-03-20 03:53:25,539 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 03:53:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:53:25,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-20 03:53:25,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-20 03:53:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 7 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:53:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:53:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971841775] [2025-03-20 03:53:30,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971841775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:53:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314525244] [2025-03-20 03:53:30,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 03:53:30,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:53:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:53:30,531 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:53:30,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-20 03:53:30,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-20 03:53:30,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-20 03:53:30,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 03:53:30,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:53:30,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-20 03:53:30,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:53:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-20 03:53:32,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:53:37,318 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 03:53:37,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 162 treesize of output 645 [2025-03-20 03:53:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-20 03:53:45,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314525244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:53:45,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:53:45,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 49, 49] total 153 [2025-03-20 03:53:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088598679] [2025-03-20 03:53:45,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:53:45,428 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 154 states [2025-03-20 03:53:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:53:45,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2025-03-20 03:53:45,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1751, Invalid=21811, Unknown=0, NotChecked=0, Total=23562 [2025-03-20 03:53:45,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:53:45,433 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:53:45,434 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 154 states, 154 states have (on average 1.12987012987013) internal successors, (174), 153 states have internal predecessors, (174), 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 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:53:45,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:53:45,435 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:53:45,435 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:53:45,435 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:53:45,435 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:54:06,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:06,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-03-20 03:54:06,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-20 03:54:06,253 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-20 03:54:06,256 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:54:06,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:54:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 699717832, now seen corresponding path program 14 times [2025-03-20 03:54:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:54:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672085367] [2025-03-20 03:54:06,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 03:54:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:54:06,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-20 03:54:06,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-20 03:54:06,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 03:54:06,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:54:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 606 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:54:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:54:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672085367] [2025-03-20 03:54:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672085367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:54:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484282748] [2025-03-20 03:54:07,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 03:54:07,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:54:07,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:54:07,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:54:07,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-20 03:54:07,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-20 03:54:07,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-20 03:54:07,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 03:54:07,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:54:07,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-20 03:54:07,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:54:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 568 proven. 36 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-20 03:54:07,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:54:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 568 proven. 36 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-20 03:54:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484282748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:54:08,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:54:08,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 20, 20] total 80 [2025-03-20 03:54:08,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133069442] [2025-03-20 03:54:08,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:54:08,182 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-03-20 03:54:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:54:08,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-03-20 03:54:08,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=5423, Unknown=0, NotChecked=0, Total=6480 [2025-03-20 03:54:08,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:54:08,184 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:54:08,184 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.0617283950617282) internal successors, (248), 80 states have internal predecessors, (248), 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 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2025-03-20 03:54:08,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:08,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-03-20 03:54:08,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:08,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-20 03:54:08,486 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-20 03:54:08,486 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:54:08,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:54:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1260774488, now seen corresponding path program 15 times [2025-03-20 03:54:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:54:08,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239060605] [2025-03-20 03:54:08,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 03:54:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:54:08,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 17 equivalence classes. [2025-03-20 03:54:08,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 119 of 119 statements. [2025-03-20 03:54:08,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-03-20 03:54:08,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:54:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 648 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:54:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:54:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239060605] [2025-03-20 03:54:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239060605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:54:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409581798] [2025-03-20 03:54:09,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 03:54:09,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:54:09,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:54:09,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:54:09,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-20 03:54:09,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 17 equivalence classes. [2025-03-20 03:54:09,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 119 of 119 statements. [2025-03-20 03:54:09,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-03-20 03:54:09,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:54:09,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-20 03:54:09,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:54:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 736 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:54:09,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:54:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 736 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 03:54:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409581798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:54:10,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:54:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 72 [2025-03-20 03:54:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82831683] [2025-03-20 03:54:10,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:54:10,234 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-20 03:54:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:54:10,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-20 03:54:10,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1346, Invalid=3910, Unknown=0, NotChecked=0, Total=5256 [2025-03-20 03:54:10,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:54:10,237 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:54:10,237 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.8904109589041096) internal successors, (284), 72 states have internal predecessors, (284), 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 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:10,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:54:10,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-03-20 03:54:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:54:10,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 03:54:10,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-20 03:54:10,516 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:54:10,516 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 03:54:10,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 03:54:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1332496584, now seen corresponding path program 16 times [2025-03-20 03:54:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 03:54:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956505076] [2025-03-20 03:54:10,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 03:54:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 03:54:10,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-20 03:54:10,599 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-20 03:54:10,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 03:54:10,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:54:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 866 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 03:54:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 03:54:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956505076] [2025-03-20 03:54:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956505076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 03:54:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020385394] [2025-03-20 03:54:20,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 03:54:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 03:54:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 03:54:20,822 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 03:54:20,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-20 03:54:20,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-20 03:54:20,933 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-20 03:54:20,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 03:54:20,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 03:54:20,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 259 conjuncts are in the unsatisfiable core [2025-03-20 03:54:20,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 03:54:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-20 03:54:27,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 03:54:54,758 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 879 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-20 03:54:54,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 03:54:54,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 32 select indices, 32 select index equivalence classes, 0 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 496 case distinctions, treesize of input 322 treesize of output 2565 [2025-03-20 03:59:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-20 03:59:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020385394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 03:59:52,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 03:59:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 97, 97] total 296 [2025-03-20 03:59:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367013820] [2025-03-20 03:59:52,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 03:59:52,493 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 297 states [2025-03-20 03:59:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 03:59:52,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 297 interpolants. [2025-03-20 03:59:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3692, Invalid=84220, Unknown=0, NotChecked=0, Total=87912 [2025-03-20 03:59:52,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 03:59:52,500 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 03:59:52,500 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 297 states, 297 states have (on average 1.0707070707070707) internal successors, (318), 296 states have internal predecessors, (318), 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 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 03:59:52,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2025-03-20 04:00:29,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-20 04:00:30,160 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:00:30,160 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 04:00:30,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:00:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1468408664, now seen corresponding path program 17 times [2025-03-20 04:00:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:00:30,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189563055] [2025-03-20 04:00:30,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 04:00:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:00:30,173 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 135 statements into 17 equivalence classes. [2025-03-20 04:00:30,248 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 135 of 135 statements. [2025-03-20 04:00:30,249 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-03-20 04:00:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:00:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 800 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 04:00:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:00:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189563055] [2025-03-20 04:00:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189563055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:00:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323386521] [2025-03-20 04:00:30,947 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 04:00:30,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:00:30,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:00:30,949 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:00:30,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-20 04:00:31,018 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 135 statements into 17 equivalence classes. [2025-03-20 04:00:32,140 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 135 of 135 statements. [2025-03-20 04:00:32,140 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-03-20 04:00:32,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:00:32,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-20 04:00:32,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:00:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 800 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 04:00:32,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:00:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 800 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 04:00:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323386521] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 04:00:33,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 04:00:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 87 [2025-03-20 04:00:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147953929] [2025-03-20 04:00:33,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 04:00:33,599 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-03-20 04:00:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:00:33,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-03-20 04:00:33,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1788, Invalid=5868, Unknown=0, NotChecked=0, Total=7656 [2025-03-20 04:00:33,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:33,601 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:00:33,602 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 3.0568181818181817) internal successors, (269), 87 states have internal predecessors, (269), 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 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2025-03-20 04:00:33,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:33,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2025-03-20 04:00:33,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:33,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-20 04:00:33,886 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:00:33,886 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 04:00:33,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:00:33,886 INFO L85 PathProgramCache]: Analyzing trace with hash -941181496, now seen corresponding path program 18 times [2025-03-20 04:00:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:00:33,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641841981] [2025-03-20 04:00:33,886 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 04:00:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:00:33,898 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 136 statements into 17 equivalence classes. [2025-03-20 04:00:34,079 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 136 of 136 statements. [2025-03-20 04:00:34,080 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-20 04:00:34,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:00:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2025-03-20 04:00:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:00:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641841981] [2025-03-20 04:00:34,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641841981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:00:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608692574] [2025-03-20 04:00:34,453 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 04:00:34,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:00:34,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:00:34,455 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:00:34,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-20 04:00:34,528 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 136 statements into 17 equivalence classes. [2025-03-20 04:00:34,902 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 136 of 136 statements. [2025-03-20 04:00:34,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-20 04:00:34,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:00:34,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-20 04:00:34,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:00:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 1 proven. 800 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-20 04:00:35,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:00:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2025-03-20 04:00:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608692574] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 04:00:35,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-20 04:00:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 39] total 46 [2025-03-20 04:00:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897770265] [2025-03-20 04:00:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:00:35,655 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-20 04:00:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:00:35,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-20 04:00:35,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1880, Unknown=0, NotChecked=0, Total=2070 [2025-03-20 04:00:35,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:35,655 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:00:35,655 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:35,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:35,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:35,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:35,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2025-03-20 04:00:35,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:35,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:35,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:35,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-20 04:00:35,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:35,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:00:35,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-20 04:00:36,134 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-20 04:00:36,134 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 04:00:36,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:00:36,134 INFO L85 PathProgramCache]: Analyzing trace with hash 820200128, now seen corresponding path program 19 times [2025-03-20 04:00:36,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:00:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938851708] [2025-03-20 04:00:36,135 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 04:00:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:00:36,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-20 04:00:36,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-20 04:00:36,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:00:36,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:00:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 803 proven. 251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:00:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:00:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938851708] [2025-03-20 04:00:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938851708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:00:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624771736] [2025-03-20 04:00:36,866 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 04:00:36,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:00:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:00:36,868 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:00:36,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-20 04:00:36,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-20 04:00:36,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-20 04:00:36,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:00:36,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:00:36,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-20 04:00:36,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:00:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 901 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:00:37,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:00:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 901 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:00:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624771736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 04:00:38,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 04:00:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 110 [2025-03-20 04:00:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215210333] [2025-03-20 04:00:38,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 04:00:38,874 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2025-03-20 04:00:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:00:38,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2025-03-20 04:00:38,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2200, Invalid=10010, Unknown=0, NotChecked=0, Total=12210 [2025-03-20 04:00:38,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:38,876 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:00:38,876 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.5045045045045047) internal successors, (389), 110 states have internal predecessors, (389), 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 04:00:38,876 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:00:38,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:00:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-20 04:00:38,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-20 04:00:39,178 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:00:39,179 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 04:00:39,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:00:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1375826976, now seen corresponding path program 20 times [2025-03-20 04:00:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:00:39,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820199217] [2025-03-20 04:00:39,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 04:00:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:00:39,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-03-20 04:00:39,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-03-20 04:00:39,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 04:00:39,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 04:00:39,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 04:00:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-20 04:00:39,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-20 04:00:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:00:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 04:00:39,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 04:00:39,431 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 04:00:39,431 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-20 04:00:39,432 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-20 04:00:39,433 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-20 04:00:39,433 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-20 04:00:39,436 INFO L422 BasicCegarLoop]: Path program histogram: [20, 1, 1, 1, 1] [2025-03-20 04:00:39,587 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-20 04:00:39,587 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-20 04:00:39,595 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 04:00:39,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:00:39 BasicIcfg [2025-03-20 04:00:39,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-20 04:00:39,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-20 04:00:39,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-20 04:00:39,597 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-20 04:00:39,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:53:05" (3/4) ... [2025-03-20 04:00:39,598 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-20 04:00:39,710 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 357. [2025-03-20 04:00:39,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-03-20 04:00:39,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-03-20 04:00:39,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-20 04:00:39,802 INFO L158 Benchmark]: Toolchain (without parser) took 454974.85ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 91.4MB in the beginning and 408.8MB in the end (delta: -317.3MB). Peak memory consumption was 588.6MB. Max. memory is 16.1GB. [2025-03-20 04:00:39,802 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 04:00:39,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.77ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 77.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-20 04:00:39,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.38ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 04:00:39,803 INFO L158 Benchmark]: Boogie Preprocessor took 27.64ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 74.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 04:00:39,804 INFO L158 Benchmark]: RCFGBuilder took 473.94ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 87.4MB in the end (delta: -13.2MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2025-03-20 04:00:39,804 INFO L158 Benchmark]: TraceAbstraction took 454028.35ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 86.6MB in the beginning and 453.6MB in the end (delta: -367.0MB). Peak memory consumption was 542.1MB. Max. memory is 16.1GB. [2025-03-20 04:00:39,804 INFO L158 Benchmark]: Witness Printer took 205.11ms. Allocated memory is still 1.0GB. Free memory was 453.6MB in the beginning and 408.8MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-20 04:00:39,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.77ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 77.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.38ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.64ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 74.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 473.94ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 87.4MB in the end (delta: -13.2MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * TraceAbstraction took 454028.35ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 86.6MB in the beginning and 453.6MB in the end (delta: -367.0MB). Peak memory consumption was 542.1MB. Max. memory is 16.1GB. * Witness Printer took 205.11ms. Allocated memory is still 1.0GB. Free memory was 453.6MB in the beginning and 408.8MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 157, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 149, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 149, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 157, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 149, unknown conditional: 0, unknown unconditional: 149] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 23, Number of trivial persistent sets: 11, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 157, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 149, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 149, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 157, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 149, unknown conditional: 0, unknown unconditional: 149] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=0, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=1, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=2, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=3, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=4, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=5, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=6, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=7, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=8, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=9, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=10, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=11, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=12, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=13, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=14, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=15, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=16, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=17, size=18] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=18, \at(size, Pre)=18, arr={-2:0}, counter=0, i=18, size=18] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=18, counter=0, t1=-1] [L48] 1 int i=0; VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=18, counter=0, t1=-1, t2=0] [L57] 2 int i=0; VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-2147483646, i=0, tmp=-2147483646] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-2147483646, i=1] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=1] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=1, tmp=0] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=2] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=1, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=2] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-14, i=2, tmp=-14] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-14, i=3] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=2, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=3] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-15, i=3, tmp=-15] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-15, i=4] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=3, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=4] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-16, i=4, tmp=-16] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-16, i=5] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=4, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=5] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=3, i=5, tmp=3] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=3, i=6] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=5, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=6] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=5, i=6, tmp=5] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=5, i=7] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=6, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=7] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=7, tmp=6] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=8] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=7, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=8] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=7, i=8, tmp=7] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=7, i=9] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=8, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=9] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=9, tmp=0] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=10] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=9, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=10] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-22, i=10, tmp=-22] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-22, i=11] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=10, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=11] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=11, tmp=0] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=12] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=11, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=12] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=12, tmp=0] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=13] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=12, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=13] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=9, i=13, tmp=9] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=9, i=14] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=13, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=14] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-24, i=14, tmp=-24] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-24, i=15] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=14, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=15] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-3, i=15, tmp=-3] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=-3, i=16] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=15, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=16] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=37, i=16, tmp=37] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=37, i=17] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=16, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=17] [L50] 1 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=11, i=17, tmp=11] [L48] 1 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=11, i=18] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=37, i=17, tmp=37] [L57] 2 i++ VAL [A={-2:0}, N=18, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=37, i=18] [L48] COND FALSE 1 !(i