./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:25:09,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:25:09,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:25:09,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:25:09,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:25:09,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:25:09,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:25:09,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:25:09,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:25:09,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:25:09,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:25:09,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:25:09,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:25:09,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:25:09,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:25:09,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:25:09,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:25:09,371 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:25:09,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:25:09,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:09,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:25:09,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:25:09,373 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/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 ! overflow) ) 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2025-03-04 15:25:09,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:25:09,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:25:09,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:25:09,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:25:09,626 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:25:09,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-04 15:25:10,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae2292e8/3e1a03dac319403aaa9484bfc4213579/FLAGb04f0b0ff [2025-03-04 15:25:11,023 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:25:11,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-04 15:25:11,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae2292e8/3e1a03dac319403aaa9484bfc4213579/FLAGb04f0b0ff [2025-03-04 15:25:11,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae2292e8/3e1a03dac319403aaa9484bfc4213579 [2025-03-04 15:25:11,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:25:11,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:25:11,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:11,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:25:11,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:25:11,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11, skipping insertion in model container [2025-03-04 15:25:11,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:25:11,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:11,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:25:11,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:11,544 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:25:11,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11 WrapperNode [2025-03-04 15:25:11,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:11,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:11,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:25:11,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:25:11,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,575 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 350 [2025-03-04 15:25:11,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:11,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:25:11,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:25:11,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:25:11,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,605 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:25:11,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:25:11,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:25:11,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:25:11,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:25:11,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (1/1) ... [2025-03-04 15:25:11,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:11,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:11,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:25:11,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:25:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:25:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:25:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:25:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:25:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:25:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:25:11,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:25:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:25:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:25:11,671 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:25:11,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:25:11,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:25:12,233 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:25:12,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:25:12,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:25:12,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:25:12,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:12 BoogieIcfgContainer [2025-03-04 15:25:12,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:25:12,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:25:12,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:25:12,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:25:12,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:25:11" (1/3) ... [2025-03-04 15:25:12,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2334c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:12, skipping insertion in model container [2025-03-04 15:25:12,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:11" (2/3) ... [2025-03-04 15:25:12,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2334c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:12, skipping insertion in model container [2025-03-04 15:25:12,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:12" (3/3) ... [2025-03-04 15:25:12,501 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-03-04 15:25:12,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:25:12,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 98 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-04 15:25:12,514 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:25:12,580 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:25:12,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 113 transitions, 247 flow [2025-03-04 15:25:12,652 INFO L124 PetriNetUnfolderBase]: 16/110 cut-off events. [2025-03-04 15:25:12,655 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:25:12,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 16/110 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 447 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2025-03-04 15:25:12,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 113 transitions, 247 flow [2025-03-04 15:25:12,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 108 transitions, 231 flow [2025-03-04 15:25:12,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:25:12,675 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;@5df4c041, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:25:12,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-04 15:25:12,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:25:12,678 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:25:12,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:25:12,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:12,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:25:12,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 942033, now seen corresponding path program 1 times [2025-03-04 15:25:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211621101] [2025-03-04 15:25:12,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:12,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:25:12,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:25:12,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:12,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211621101] [2025-03-04 15:25:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211621101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715989591] [2025-03-04 15:25:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:12,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:12,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:12,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:12,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 113 [2025-03-04 15:25:12,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 108 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:12,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:12,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 113 [2025-03-04 15:25:12,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:14,582 INFO L124 PetriNetUnfolderBase]: 12542/23557 cut-off events. [2025-03-04 15:25:14,582 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2025-03-04 15:25:14,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40543 conditions, 23557 events. 12542/23557 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 210578 event pairs, 8652 based on Foata normal form. 1/18441 useless extension candidates. Maximal degree in co-relation 39200. Up to 16540 conditions per place. [2025-03-04 15:25:14,734 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 55 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-03-04 15:25:14,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 349 flow [2025-03-04 15:25:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-03-04 15:25:14,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6017699115044248 [2025-03-04 15:25:14,748 INFO L175 Difference]: Start difference. First operand has 102 places, 108 transitions, 231 flow. Second operand 4 states and 272 transitions. [2025-03-04 15:25:14,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 108 transitions, 349 flow [2025-03-04 15:25:14,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:14,760 INFO L231 Difference]: Finished difference. Result has 102 places, 108 transitions, 245 flow [2025-03-04 15:25:14,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=102, PETRI_TRANSITIONS=108} [2025-03-04 15:25:14,764 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 0 predicate places. [2025-03-04 15:25:14,764 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 108 transitions, 245 flow [2025-03-04 15:25:14,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:14,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:14,765 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:25:14,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:25:14,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1999804660, now seen corresponding path program 1 times [2025-03-04 15:25:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842979] [2025-03-04 15:25:14,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:14,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:14,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:14,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842979] [2025-03-04 15:25:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624666802] [2025-03-04 15:25:14,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:14,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:14,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:14,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:14,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:25:14,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:14,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:14,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:14,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:14,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:14,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:14,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:25:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624666802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:14,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:25:14,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:25:14,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138494489] [2025-03-04 15:25:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:14,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:14,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:25:14,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 113 [2025-03-04 15:25:14,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 108 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:14,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:14,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 113 [2025-03-04 15:25:14,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:16,483 INFO L124 PetriNetUnfolderBase]: 12542/23556 cut-off events. [2025-03-04 15:25:16,484 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-04 15:25:16,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40390 conditions, 23556 events. 12542/23556 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 210666 event pairs, 8652 based on Foata normal form. 1/18441 useless extension candidates. Maximal degree in co-relation 40363. Up to 16535 conditions per place. [2025-03-04 15:25:16,642 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 51 selfloop transitions, 7 changer transitions 0/107 dead transitions. [2025-03-04 15:25:16,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 357 flow [2025-03-04 15:25:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 371 transitions. [2025-03-04 15:25:16,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5471976401179941 [2025-03-04 15:25:16,647 INFO L175 Difference]: Start difference. First operand has 102 places, 108 transitions, 245 flow. Second operand 6 states and 371 transitions. [2025-03-04 15:25:16,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 357 flow [2025-03-04 15:25:16,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 107 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:16,650 INFO L231 Difference]: Finished difference. Result has 105 places, 107 transitions, 252 flow [2025-03-04 15:25:16,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2025-03-04 15:25:16,651 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2025-03-04 15:25:16,651 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 252 flow [2025-03-04 15:25:16,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:16,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:16,652 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:25:16,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:16,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:16,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:16,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1864401449, now seen corresponding path program 1 times [2025-03-04 15:25:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:16,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133657729] [2025-03-04 15:25:16,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:16,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:16,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:16,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133657729] [2025-03-04 15:25:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133657729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:17,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024703791] [2025-03-04 15:25:17,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:17,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:17,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:25:17,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:17,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:17,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:17,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:17,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:17,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:17,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024703791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:17,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:25:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930562544] [2025-03-04 15:25:17,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:17,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:25:17,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:17,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:25:17,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:25:17,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 113 [2025-03-04 15:25:17,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 252 flow. Second operand has 12 states, 12 states have (on average 53.083333333333336) internal successors, (637), 12 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:17,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:17,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 113 [2025-03-04 15:25:17,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:18,319 INFO L124 PetriNetUnfolderBase]: 12545/23568 cut-off events. [2025-03-04 15:25:18,320 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-04 15:25:18,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40434 conditions, 23568 events. 12545/23568 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 210794 event pairs, 8652 based on Foata normal form. 3/18453 useless extension candidates. Maximal degree in co-relation 40364. Up to 16542 conditions per place. [2025-03-04 15:25:18,457 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 54 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2025-03-04 15:25:18,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 440 flow [2025-03-04 15:25:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:25:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:25:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 590 transitions. [2025-03-04 15:25:18,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5221238938053098 [2025-03-04 15:25:18,460 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 252 flow. Second operand 10 states and 590 transitions. [2025-03-04 15:25:18,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 440 flow [2025-03-04 15:25:18,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 116 transitions, 394 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:18,463 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 304 flow [2025-03-04 15:25:18,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2025-03-04 15:25:18,463 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2025-03-04 15:25:18,463 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 304 flow [2025-03-04 15:25:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 53.083333333333336) internal successors, (637), 12 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:18,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:18,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:18,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:18,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:25:18,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1714554409, now seen corresponding path program 1 times [2025-03-04 15:25:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-04 15:25:18,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:18,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:18,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-04 15:25:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360294191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031124384] [2025-03-04 15:25:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:18,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:18,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:18,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 113 [2025-03-04 15:25:18,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:18,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:18,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 113 [2025-03-04 15:25:18,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:21,043 INFO L124 PetriNetUnfolderBase]: 27152/48898 cut-off events. [2025-03-04 15:25:21,043 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 15:25:21,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85443 conditions, 48898 events. 27152/48898 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 462025 event pairs, 11234 based on Foata normal form. 366/39885 useless extension candidates. Maximal degree in co-relation 85409. Up to 20438 conditions per place. [2025-03-04 15:25:21,383 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 146 selfloop transitions, 3 changer transitions 0/197 dead transitions. [2025-03-04 15:25:21,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 197 transitions, 772 flow [2025-03-04 15:25:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-03-04 15:25:21,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7676991150442478 [2025-03-04 15:25:21,384 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 304 flow. Second operand 4 states and 347 transitions. [2025-03-04 15:25:21,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 197 transitions, 772 flow [2025-03-04 15:25:21,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 197 transitions, 761 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:21,390 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 315 flow [2025-03-04 15:25:21,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-03-04 15:25:21,390 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 13 predicate places. [2025-03-04 15:25:21,391 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 315 flow [2025-03-04 15:25:21,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:21,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:21,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:21,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:21,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:21,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash -163971369, now seen corresponding path program 1 times [2025-03-04 15:25:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-04 15:25:21,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:21,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:21,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:21,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-04 15:25:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120051772] [2025-03-04 15:25:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:21,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:21,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:21,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:21,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 113 [2025-03-04 15:25:21,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:21,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:21,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 113 [2025-03-04 15:25:21,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:26,205 INFO L124 PetriNetUnfolderBase]: 51817/93039 cut-off events. [2025-03-04 15:25:26,206 INFO L125 PetriNetUnfolderBase]: For 6307/7487 co-relation queries the response was YES. [2025-03-04 15:25:26,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167049 conditions, 93039 events. 51817/93039 cut-off events. For 6307/7487 co-relation queries the response was YES. Maximal size of possible extension queue 3809. Compared 953890 event pairs, 21501 based on Foata normal form. 726/77157 useless extension candidates. Maximal degree in co-relation 167013. Up to 38574 conditions per place. [2025-03-04 15:25:26,870 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 149 selfloop transitions, 3 changer transitions 0/200 dead transitions. [2025-03-04 15:25:26,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 200 transitions, 818 flow [2025-03-04 15:25:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-03-04 15:25:26,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7610619469026548 [2025-03-04 15:25:26,872 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 315 flow. Second operand 4 states and 344 transitions. [2025-03-04 15:25:26,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 200 transitions, 818 flow [2025-03-04 15:25:26,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 200 transitions, 812 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:26,877 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 335 flow [2025-03-04 15:25:26,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-03-04 15:25:26,878 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 17 predicate places. [2025-03-04 15:25:26,878 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 335 flow [2025-03-04 15:25:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:26,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:26,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:26,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:26,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1755485121, now seen corresponding path program 1 times [2025-03-04 15:25:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066578656] [2025-03-04 15:25:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:26,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:25:26,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:25:26,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066578656] [2025-03-04 15:25:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066578656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403857870] [2025-03-04 15:25:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:26,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:26,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:26,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:26,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:26,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 113 [2025-03-04 15:25:26,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:26,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:26,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 113 [2025-03-04 15:25:26,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:30,951 INFO L124 PetriNetUnfolderBase]: 43409/71809 cut-off events. [2025-03-04 15:25:30,951 INFO L125 PetriNetUnfolderBase]: For 8350/9794 co-relation queries the response was YES. [2025-03-04 15:25:31,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139556 conditions, 71809 events. 43409/71809 cut-off events. For 8350/9794 co-relation queries the response was YES. Maximal size of possible extension queue 2495. Compared 640503 event pairs, 17302 based on Foata normal form. 0/62082 useless extension candidates. Maximal degree in co-relation 139518. Up to 31255 conditions per place. [2025-03-04 15:25:31,496 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 181 selfloop transitions, 4 changer transitions 0/235 dead transitions. [2025-03-04 15:25:31,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 235 transitions, 990 flow [2025-03-04 15:25:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2025-03-04 15:25:31,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716814159292036 [2025-03-04 15:25:31,498 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 335 flow. Second operand 5 states and 436 transitions. [2025-03-04 15:25:31,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 235 transitions, 990 flow [2025-03-04 15:25:31,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 235 transitions, 982 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:31,565 INFO L231 Difference]: Finished difference. Result has 125 places, 122 transitions, 358 flow [2025-03-04 15:25:31,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=125, PETRI_TRANSITIONS=122} [2025-03-04 15:25:31,566 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 23 predicate places. [2025-03-04 15:25:31,566 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 122 transitions, 358 flow [2025-03-04 15:25:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:31,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:31,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:31,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:31,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1795871582, now seen corresponding path program 1 times [2025-03-04 15:25:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111077133] [2025-03-04 15:25:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:31,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:25:31,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:25:31,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:31,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111077133] [2025-03-04 15:25:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111077133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-03-04 15:25:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:31,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:31,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:31,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 113 [2025-03-04 15:25:31,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 122 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:31,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:31,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 113 [2025-03-04 15:25:31,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:40,221 INFO L124 PetriNetUnfolderBase]: 83876/148890 cut-off events. [2025-03-04 15:25:40,221 INFO L125 PetriNetUnfolderBase]: For 37538/41497 co-relation queries the response was YES. [2025-03-04 15:25:41,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288639 conditions, 148890 events. 83876/148890 cut-off events. For 37538/41497 co-relation queries the response was YES. Maximal size of possible extension queue 5155. Compared 1560829 event pairs, 37665 based on Foata normal form. 1181/127880 useless extension candidates. Maximal degree in co-relation 288599. Up to 63586 conditions per place. [2025-03-04 15:25:41,530 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 158 selfloop transitions, 3 changer transitions 0/209 dead transitions. [2025-03-04 15:25:41,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 209 transitions, 948 flow [2025-03-04 15:25:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2025-03-04 15:25:41,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.754424778761062 [2025-03-04 15:25:41,531 INFO L175 Difference]: Start difference. First operand has 125 places, 122 transitions, 358 flow. Second operand 4 states and 341 transitions. [2025-03-04 15:25:41,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 209 transitions, 948 flow [2025-03-04 15:25:41,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 209 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:41,550 INFO L231 Difference]: Finished difference. Result has 130 places, 124 transitions, 380 flow [2025-03-04 15:25:41,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=130, PETRI_TRANSITIONS=124} [2025-03-04 15:25:41,551 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 28 predicate places. [2025-03-04 15:25:41,551 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 124 transitions, 380 flow [2025-03-04 15:25:41,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:41,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:41,551 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:41,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:25:41,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:25:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1381059090, now seen corresponding path program 1 times [2025-03-04 15:25:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-04 15:25:41,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:41,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:25:41,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:25:41,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:41,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-04 15:25:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295978408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786698045] [2025-03-04 15:25:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:41,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 113 [2025-03-04 15:25:41,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:41,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:41,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 113 [2025-03-04 15:25:41,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand