./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:50:27,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:50:27,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:50:27,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:50:27,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:50:27,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:50:27,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:50:27,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:50:27,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:50:27,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:50:27,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:50:27,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:50:27,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:50:27,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:50:27,569 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:50:27,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:50:27,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:50:27,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:50:27,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:50:27,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:50:27,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:27,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:27,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:27,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:27,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:50:27,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:27,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:50:27,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 [2025-01-09 16:50:27,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:50:27,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:50:27,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:50:27,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:50:27,821 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:50:27,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-01-09 16:50:28,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c612aebf3/e2f6ffae256e4b3e8b4dcb4b83126194/FLAG24f6243bd [2025-01-09 16:50:29,250 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:50:29,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-01-09 16:50:29,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c612aebf3/e2f6ffae256e4b3e8b4dcb4b83126194/FLAG24f6243bd [2025-01-09 16:50:29,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c612aebf3/e2f6ffae256e4b3e8b4dcb4b83126194 [2025-01-09 16:50:29,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:50:29,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:50:29,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:29,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:50:29,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:50:29,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29043033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29, skipping insertion in model container [2025-01-09 16:50:29,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:50:29,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-01-09 16:50:29,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:29,821 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:50:29,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-01-09 16:50:29,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:29,885 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:50:29,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29 WrapperNode [2025-01-09 16:50:29,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:29,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:29,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:50:29,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:50:29,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,930 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-01-09 16:50:29,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:29,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:50:29,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:50:29,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:50:29,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,947 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-01-09 16:50:29,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:50:29,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:50:29,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:50:29,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:50:29,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (1/1) ... [2025-01-09 16:50:29,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:29,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:29,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:50:29,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:50:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:50:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:50:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:50:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:50:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:50:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:50:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:50:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:50:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:50:30,007 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:50:30,114 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:50:30,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:50:30,382 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:50:30,382 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:50:31,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:50:31,109 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:50:31,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:31 BoogieIcfgContainer [2025-01-09 16:50:31,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:50:31,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:50:31,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:50:31,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:50:31,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:50:29" (1/3) ... [2025-01-09 16:50:31,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63abd7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:31, skipping insertion in model container [2025-01-09 16:50:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:29" (2/3) ... [2025-01-09 16:50:31,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63abd7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:31, skipping insertion in model container [2025-01-09 16:50:31,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:31" (3/3) ... [2025-01-09 16:50:31,117 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-01-09 16:50:31,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:50:31,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:50:31,133 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:50:31,192 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:50:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-01-09 16:50:31,241 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-01-09 16:50:31,243 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:50:31,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-01-09 16:50:31,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-01-09 16:50:31,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 76 flow [2025-01-09 16:50:31,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:50:31,263 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@642bf983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:50:31,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:50:31,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:50:31,289 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-01-09 16:50:31,289 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:50:31,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:31,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:31,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:31,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 996373192, now seen corresponding path program 1 times [2025-01-09 16:50:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:31,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616192104] [2025-01-09 16:50:31,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:31,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:50:31,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:50:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:31,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616192104] [2025-01-09 16:50:31,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616192104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:31,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:31,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:50:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702671415] [2025-01-09 16:50:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:31,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:31,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:31,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:31,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-09 16:50:31,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:31,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:31,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-09 16:50:31,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:32,157 INFO L124 PetriNetUnfolderBase]: 440/782 cut-off events. [2025-01-09 16:50:32,158 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-09 16:50:32,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 782 events. 440/782 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3638 event pairs, 173 based on Foata normal form. 18/772 useless extension candidates. Maximal degree in co-relation 1442. Up to 418 conditions per place. [2025-01-09 16:50:32,164 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 38 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-09 16:50:32,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 193 flow [2025-01-09 16:50:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-01-09 16:50:32,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2025-01-09 16:50:32,176 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 80 transitions. [2025-01-09 16:50:32,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 193 flow [2025-01-09 16:50:32,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 183 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:50:32,185 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 80 flow [2025-01-09 16:50:32,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-01-09 16:50:32,190 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-01-09 16:50:32,193 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 80 flow [2025-01-09 16:50:32,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:32,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:32,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:32,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:50:32,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -967733530, now seen corresponding path program 1 times [2025-01-09 16:50:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053443275] [2025-01-09 16:50:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:50:32,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:50:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:50:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053443275] [2025-01-09 16:50:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053443275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:32,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:50:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428970168] [2025-01-09 16:50:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:32,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:32,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:32,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:32,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-09 16:50:32,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:32,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:32,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-09 16:50:32,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:32,743 INFO L124 PetriNetUnfolderBase]: 741/1322 cut-off events. [2025-01-09 16:50:32,743 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-01-09 16:50:32,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1322 events. 741/1322 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6689 event pairs, 300 based on Foata normal form. 29/1320 useless extension candidates. Maximal degree in co-relation 964. Up to 696 conditions per place. [2025-01-09 16:50:32,756 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 39 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-09 16:50:32,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 207 flow [2025-01-09 16:50:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-01-09 16:50:32,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2025-01-09 16:50:32,759 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 80 flow. Second operand 3 states and 79 transitions. [2025-01-09 16:50:32,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 207 flow [2025-01-09 16:50:32,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:32,760 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 90 flow [2025-01-09 16:50:32,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-01-09 16:50:32,761 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-01-09 16:50:32,761 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 90 flow [2025-01-09 16:50:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:32,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:32,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:32,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:50:32,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash -881810338, now seen corresponding path program 1 times [2025-01-09 16:50:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276567905] [2025-01-09 16:50:32,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:32,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:50:32,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:50:32,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:32,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276567905] [2025-01-09 16:50:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276567905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:33,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:50:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230946427] [2025-01-09 16:50:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:33,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:33,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:33,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-09 16:50:33,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:33,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-09 16:50:33,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:33,269 INFO L124 PetriNetUnfolderBase]: 427/895 cut-off events. [2025-01-09 16:50:33,269 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2025-01-09 16:50:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 895 events. 427/895 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4293 event pairs, 182 based on Foata normal form. 64/954 useless extension candidates. Maximal degree in co-relation 629. Up to 372 conditions per place. [2025-01-09 16:50:33,275 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 29 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2025-01-09 16:50:33,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 208 flow [2025-01-09 16:50:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-01-09 16:50:33,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-09 16:50:33,276 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 90 flow. Second operand 3 states and 76 transitions. [2025-01-09 16:50:33,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 208 flow [2025-01-09 16:50:33,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:33,278 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 104 flow [2025-01-09 16:50:33,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-01-09 16:50:33,278 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-01-09 16:50:33,278 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 104 flow [2025-01-09 16:50:33,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:33,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:33,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:50:33,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:33,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 136078144, now seen corresponding path program 2 times [2025-01-09 16:50:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612531356] [2025-01-09 16:50:33,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:33,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:50:33,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:50:33,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:50:33,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:33,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612531356] [2025-01-09 16:50:33,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612531356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:33,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:33,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:50:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104486983] [2025-01-09 16:50:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:33,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:50:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:33,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:50:33,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:50:33,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-09 16:50:33,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:33,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:33,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-09 16:50:33,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:33,732 INFO L124 PetriNetUnfolderBase]: 628/1302 cut-off events. [2025-01-09 16:50:33,733 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2025-01-09 16:50:33,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1302 events. 628/1302 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6827 event pairs, 184 based on Foata normal form. 30/1314 useless extension candidates. Maximal degree in co-relation 781. Up to 482 conditions per place. [2025-01-09 16:50:33,738 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 57 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-01-09 16:50:33,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 346 flow [2025-01-09 16:50:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:50:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:50:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-09 16:50:33,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7236842105263158 [2025-01-09 16:50:33,740 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 104 flow. Second operand 4 states and 110 transitions. [2025-01-09 16:50:33,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 346 flow [2025-01-09 16:50:33,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 69 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:33,742 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 112 flow [2025-01-09 16:50:33,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-01-09 16:50:33,743 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-01-09 16:50:33,743 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 112 flow [2025-01-09 16:50:33,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:33,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:33,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:33,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:50:33,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:33,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1616170946, now seen corresponding path program 3 times [2025-01-09 16:50:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:33,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108412082] [2025-01-09 16:50:33,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:50:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:33,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-01-09 16:50:33,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 32 statements. [2025-01-09 16:50:33,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:50:33,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 16:50:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108412082] [2025-01-09 16:50:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108412082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:50:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374420240] [2025-01-09 16:50:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:33,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:50:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:33,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:50:33,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:50:33,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-09 16:50:33,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:33,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:33,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-09 16:50:33,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:34,159 INFO L124 PetriNetUnfolderBase]: 848/1791 cut-off events. [2025-01-09 16:50:34,159 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2025-01-09 16:50:34,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4132 conditions, 1791 events. 848/1791 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9871 event pairs, 258 based on Foata normal form. 41/1810 useless extension candidates. Maximal degree in co-relation 1304. Up to 666 conditions per place. [2025-01-09 16:50:34,168 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 58 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2025-01-09 16:50:34,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 368 flow [2025-01-09 16:50:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:50:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:50:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-01-09 16:50:34,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2025-01-09 16:50:34,171 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 112 flow. Second operand 4 states and 108 transitions. [2025-01-09 16:50:34,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 368 flow [2025-01-09 16:50:34,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 350 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:50:34,173 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 122 flow [2025-01-09 16:50:34,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-01-09 16:50:34,174 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-09 16:50:34,174 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 122 flow [2025-01-09 16:50:34,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:34,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:34,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:50:34,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -192090100, now seen corresponding path program 4 times [2025-01-09 16:50:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705807155] [2025-01-09 16:50:34,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:50:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:34,324 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-09 16:50:34,330 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 38 statements. [2025-01-09 16:50:34,330 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:50:34,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 16:50:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705807155] [2025-01-09 16:50:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705807155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:50:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586995270] [2025-01-09 16:50:34,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:50:34,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:34,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:50:34,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:50:34,745 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-09 16:50:34,757 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 38 statements. [2025-01-09 16:50:34,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:50:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:34,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:50:34,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:50:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:50:34,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:50:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:50:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586995270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:50:34,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:50:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 16:50:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795682692] [2025-01-09 16:50:34,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:50:34,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:50:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:34,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:50:34,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:50:34,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-01-09 16:50:34,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 122 flow. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:34,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:34,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-01-09 16:50:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:35,298 INFO L124 PetriNetUnfolderBase]: 1810/3543 cut-off events. [2025-01-09 16:50:35,298 INFO L125 PetriNetUnfolderBase]: For 1762/1762 co-relation queries the response was YES. [2025-01-09 16:50:35,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8349 conditions, 3543 events. 1810/3543 cut-off events. For 1762/1762 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 20041 event pairs, 83 based on Foata normal form. 164/3699 useless extension candidates. Maximal degree in co-relation 2425. Up to 618 conditions per place. [2025-01-09 16:50:35,312 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 246 selfloop transitions, 44 changer transitions 0/298 dead transitions. [2025-01-09 16:50:35,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 298 transitions, 1535 flow [2025-01-09 16:50:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:50:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:50:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 555 transitions. [2025-01-09 16:50:35,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6954887218045113 [2025-01-09 16:50:35,314 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 122 flow. Second operand 21 states and 555 transitions. [2025-01-09 16:50:35,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 298 transitions, 1535 flow [2025-01-09 16:50:35,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 298 transitions, 1511 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:50:35,319 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 490 flow [2025-01-09 16:50:35,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=490, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2025-01-09 16:50:35,319 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-01-09 16:50:35,319 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 490 flow [2025-01-09 16:50:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:35,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:35,320 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:35,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:50:35,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:35,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:35,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1629965178, now seen corresponding path program 5 times [2025-01-09 16:50:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925358603] [2025-01-09 16:50:35,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:50:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:35,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 5 equivalence classes. [2025-01-09 16:50:35,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:50:35,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 16:50:35,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:50:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925358603] [2025-01-09 16:50:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925358603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:35,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:35,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:50:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563248179] [2025-01-09 16:50:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:35,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:35,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:35,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:35,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-01-09 16:50:35,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:35,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:35,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-01-09 16:50:35,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:36,021 INFO L124 PetriNetUnfolderBase]: 1679/3432 cut-off events. [2025-01-09 16:50:36,021 INFO L125 PetriNetUnfolderBase]: For 9723/9723 co-relation queries the response was YES. [2025-01-09 16:50:36,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10805 conditions, 3432 events. 1679/3432 cut-off events. For 9723/9723 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19566 event pairs, 419 based on Foata normal form. 0/3245 useless extension candidates. Maximal degree in co-relation 9567. Up to 1609 conditions per place. [2025-01-09 16:50:36,038 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 97 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2025-01-09 16:50:36,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 997 flow [2025-01-09 16:50:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:50:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:50:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-09 16:50:36,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5723684210526315 [2025-01-09 16:50:36,039 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 490 flow. Second operand 4 states and 87 transitions. [2025-01-09 16:50:36,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 997 flow [2025-01-09 16:50:36,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 843 flow, removed 48 selfloop flow, removed 4 redundant places. [2025-01-09 16:50:36,068 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 413 flow [2025-01-09 16:50:36,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2025-01-09 16:50:36,069 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2025-01-09 16:50:36,069 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 413 flow [2025-01-09 16:50:36,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:36,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:36,069 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:36,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:50:36,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:36,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1342541156, now seen corresponding path program 6 times [2025-01-09 16:50:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25153898] [2025-01-09 16:50:36,070 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:50:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:36,203 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-01-09 16:50:36,226 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 50 of 56 statements. [2025-01-09 16:50:36,226 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 16:50:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 16:50:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:36,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25153898] [2025-01-09 16:50:36,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25153898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:36,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:36,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:50:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113209054] [2025-01-09 16:50:36,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:36,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:36,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:36,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:36,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-01-09 16:50:36,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:36,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:36,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-01-09 16:50:36,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:36,492 INFO L124 PetriNetUnfolderBase]: 1217/2529 cut-off events. [2025-01-09 16:50:36,492 INFO L125 PetriNetUnfolderBase]: For 7376/7376 co-relation queries the response was YES. [2025-01-09 16:50:36,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8343 conditions, 2529 events. 1217/2529 cut-off events. For 7376/7376 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 13704 event pairs, 303 based on Foata normal form. 0/2420 useless extension candidates. Maximal degree in co-relation 7347. Up to 1760 conditions per place. [2025-01-09 16:50:36,507 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 72 selfloop transitions, 3 changer transitions 2/88 dead transitions. [2025-01-09 16:50:36,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 652 flow [2025-01-09 16:50:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-09 16:50:36,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2025-01-09 16:50:36,508 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 413 flow. Second operand 3 states and 73 transitions. [2025-01-09 16:50:36,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 652 flow [2025-01-09 16:50:36,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:36,520 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 417 flow [2025-01-09 16:50:36,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-09 16:50:36,521 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2025-01-09 16:50:36,521 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 417 flow [2025-01-09 16:50:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:36,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:36,521 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:36,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:50:36,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:36,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash -582183774, now seen corresponding path program 7 times [2025-01-09 16:50:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112050601] [2025-01-09 16:50:36,522 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:50:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:36,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 16:50:36,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:50:36,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:36,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:50:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112050601] [2025-01-09 16:50:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112050601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:50:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356489900] [2025-01-09 16:50:36,869 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:50:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:36,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:50:36,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:50:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 16:50:37,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:50:37,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:37,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:37,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:50:37,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:50:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:50:37,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:50:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:50:37,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356489900] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:50:37,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:50:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-01-09 16:50:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156163600] [2025-01-09 16:50:37,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:50:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:50:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:37,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:50:37,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:50:37,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-01-09 16:50:37,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:37,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:37,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-01-09 16:50:37,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:37,660 INFO L124 PetriNetUnfolderBase]: 1340/2741 cut-off events. [2025-01-09 16:50:37,660 INFO L125 PetriNetUnfolderBase]: For 8448/8465 co-relation queries the response was YES. [2025-01-09 16:50:37,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8625 conditions, 2741 events. 1340/2741 cut-off events. For 8448/8465 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 14454 event pairs, 121 based on Foata normal form. 53/2775 useless extension candidates. Maximal degree in co-relation 7930. Up to 714 conditions per place. [2025-01-09 16:50:37,671 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 95 selfloop transitions, 18 changer transitions 1/128 dead transitions. [2025-01-09 16:50:37,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 943 flow [2025-01-09 16:50:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:50:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:50:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-01-09 16:50:37,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6798245614035088 [2025-01-09 16:50:37,672 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 417 flow. Second operand 6 states and 155 transitions. [2025-01-09 16:50:37,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 943 flow [2025-01-09 16:50:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 128 transitions, 929 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:50:37,683 INFO L231 Difference]: Finished difference. Result has 83 places, 72 transitions, 461 flow [2025-01-09 16:50:37,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2025-01-09 16:50:37,683 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-01-09 16:50:37,683 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 461 flow [2025-01-09 16:50:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:37,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:37,683 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:37,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:50:37,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:37,888 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:37,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 979817788, now seen corresponding path program 8 times [2025-01-09 16:50:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649000034] [2025-01-09 16:50:37,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:38,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-01-09 16:50:38,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:50:38,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:38,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:50:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649000034] [2025-01-09 16:50:38,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649000034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:50:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001737544] [2025-01-09 16:50:38,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:38,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:50:38,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:50:38,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-01-09 16:50:38,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:50:38,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:38,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:50:38,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:50:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:50:38,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:50:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:50:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001737544] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:50:39,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:50:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2025-01-09 16:50:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815045346] [2025-01-09 16:50:39,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:50:39,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 16:50:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:39,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 16:50:39,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2025-01-09 16:50:39,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-01-09 16:50:39,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 461 flow. Second operand has 31 states, 31 states have (on average 14.03225806451613) internal successors, (435), 31 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:39,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:39,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-01-09 16:50:39,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:40,885 INFO L124 PetriNetUnfolderBase]: 1249/2593 cut-off events. [2025-01-09 16:50:40,885 INFO L125 PetriNetUnfolderBase]: For 8392/8408 co-relation queries the response was YES. [2025-01-09 16:50:40,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8873 conditions, 2593 events. 1249/2593 cut-off events. For 8392/8408 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 14163 event pairs, 73 based on Foata normal form. 74/2663 useless extension candidates. Maximal degree in co-relation 7817. Up to 542 conditions per place. [2025-01-09 16:50:40,895 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 0 selfloop transitions, 0 changer transitions 167/167 dead transitions. [2025-01-09 16:50:40,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1333 flow [2025-01-09 16:50:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:50:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:50:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2025-01-09 16:50:40,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5241228070175439 [2025-01-09 16:50:40,898 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 461 flow. Second operand 12 states and 239 transitions. [2025-01-09 16:50:40,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1333 flow [2025-01-09 16:50:40,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 167 transitions, 1256 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-01-09 16:50:40,912 INFO L231 Difference]: Finished difference. Result has 89 places, 0 transitions, 0 flow [2025-01-09 16:50:40,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=89, PETRI_TRANSITIONS=0} [2025-01-09 16:50:40,913 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2025-01-09 16:50:40,913 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 0 transitions, 0 flow [2025-01-09 16:50:40,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 14.03225806451613) internal successors, (435), 31 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-09 16:50:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-09 16:50:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-09 16:50:40,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:50:41,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:41,120 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2025-01-09 16:50:41,123 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:50:41,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:50:41,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:50:41 BasicIcfg [2025-01-09 16:50:41,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:50:41,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:50:41,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:50:41,132 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:50:41,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:31" (3/4) ... [2025-01-09 16:50:41,133 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:50:41,135 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 16:50:41,135 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 16:50:41,139 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 253 nodes and edges [2025-01-09 16:50:41,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 16:50:41,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 16:50:41,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:50:41,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 16:50:41,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:50:41,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:50:41,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:50:41,192 INFO L158 Benchmark]: Toolchain (without parser) took 11653.43ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 109.8MB in the beginning and 834.9MB in the end (delta: -725.1MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.41ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 81.4MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.37ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: Boogie Preprocessor took 28.89ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 75.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: RCFGBuilder took 1150.51ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 75.7MB in the beginning and 258.7MB in the end (delta: -183.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: TraceAbstraction took 10019.08ms. Allocated memory was 369.1MB in the beginning and 1.1GB in the end (delta: 687.9MB). Free memory was 257.7MB in the beginning and 841.4MB in the end (delta: -583.7MB). Peak memory consumption was 560.0MB. Max. memory is 16.1GB. [2025-01-09 16:50:41,192 INFO L158 Benchmark]: Witness Printer took 59.67ms. Allocated memory is still 1.1GB. Free memory was 841.4MB in the beginning and 834.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:50:41,193 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.41ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 81.4MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.37ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.89ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 75.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1150.51ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 75.7MB in the beginning and 258.7MB in the end (delta: -183.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10019.08ms. Allocated memory was 369.1MB in the beginning and 1.1GB in the end (delta: 687.9MB). Free memory was 257.7MB in the beginning and 841.4MB in the end (delta: -583.7MB). Peak memory consumption was 560.0MB. Max. memory is 16.1GB. * Witness Printer took 59.67ms. Allocated memory is still 1.1GB. Free memory was 841.4MB in the beginning and 834.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3529 IncrementalHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 2 mSDtfsCounter, 3529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 306 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=6, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 542 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 2295 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1198 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 158/353 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 16:50:41,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE