./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/reorder_5.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:32:57,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:32:57,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:32:58,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:32:58,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:32:58,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:32:58,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:32:58,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:32:58,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:32:58,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:32:58,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:32:58,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:32:58,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:32:58,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:32:58,019 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:32:58,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:32:58,020 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:32:58,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:58,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:32:58,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:58,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:32:58,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:32:58,022 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 ! 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 -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-01-10 06:32:58,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:32:58,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:32:58,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:32:58,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:32:58,318 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:32:58,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-01-10 06:32:59,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f8afc96/2c8d99eb41564aefb3bf8c7d871be2ea/FLAG09cd5d6ae [2025-01-10 06:32:59,933 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:32:59,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-01-10 06:32:59,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f8afc96/2c8d99eb41564aefb3bf8c7d871be2ea/FLAG09cd5d6ae [2025-01-10 06:32:59,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f8afc96/2c8d99eb41564aefb3bf8c7d871be2ea [2025-01-10 06:32:59,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:32:59,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:32:59,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:59,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:32:59,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:32:59,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:59" (1/1) ... [2025-01-10 06:32:59,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5912579c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:59, skipping insertion in model container [2025-01-10 06:32:59,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:59" (1/1) ... [2025-01-10 06:32:59,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:33:00,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:33:00,388 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:33:00,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:33:00,495 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:33:00,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00 WrapperNode [2025-01-10 06:33:00,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:33:00,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:33:00,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:33:00,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:33:00,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,528 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-01-10 06:33:00,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:33:00,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:33:00,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:33:00,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:33:00,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,549 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-10 06:33:00,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:33:00,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:33:00,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:33:00,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:33:00,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (1/1) ... [2025-01-10 06:33:00,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:33:00,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:00,586 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-10 06:33:00,588 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-10 06:33:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:33:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:33:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:33:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-10 06:33:00,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:33:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:33:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-10 06:33:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-10 06:33:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:33:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:33:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:33:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:33:00,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:33:00,609 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:33:00,739 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:33:00,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:33:00,935 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:33:00,935 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:33:01,060 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:33:01,060 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:33:01,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:33:01 BoogieIcfgContainer [2025-01-10 06:33:01,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:33:01,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:33:01,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:33:01,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:33:01,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:32:59" (1/3) ... [2025-01-10 06:33:01,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444e9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:33:01, skipping insertion in model container [2025-01-10 06:33:01,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:00" (2/3) ... [2025-01-10 06:33:01,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444e9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:33:01, skipping insertion in model container [2025-01-10 06:33:01,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:33:01" (3/3) ... [2025-01-10 06:33:01,067 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-01-10 06:33:01,076 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:33:01,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 40 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-01-10 06:33:01,077 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:33:01,123 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 06:33:01,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 110 flow [2025-01-10 06:33:01,199 INFO L124 PetriNetUnfolderBase]: 8/100 cut-off events. [2025-01-10 06:33:01,201 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 06:33:01,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 100 events. 8/100 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 386 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 50. Up to 7 conditions per place. [2025-01-10 06:33:01,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 110 flow [2025-01-10 06:33:01,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 108 flow [2025-01-10 06:33:01,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:33:01,217 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;@561be93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:33:01,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:33:01,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:33:01,223 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-10 06:33:01,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:01,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:01,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:01,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:01,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash 359790136, now seen corresponding path program 1 times [2025-01-10 06:33:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682933244] [2025-01-10 06:33:01,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:01,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:01,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:01,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:01,488 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-10 06:33:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682933244] [2025-01-10 06:33:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682933244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775700360] [2025-01-10 06:33:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:01,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:01,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:01,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:01,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-10 06:33:01,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-10 06:33:01,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:01,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-10 06:33:01,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:01,667 INFO L124 PetriNetUnfolderBase]: 73/269 cut-off events. [2025-01-10 06:33:01,668 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:33:01,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 269 events. 73/269 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1475 event pairs, 41 based on Foata normal form. 2/224 useless extension candidates. Maximal degree in co-relation 279. Up to 126 conditions per place. [2025-01-10 06:33:01,673 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 31 selfloop transitions, 9 changer transitions 2/60 dead transitions. [2025-01-10 06:33:01,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 236 flow [2025-01-10 06:33:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-01-10 06:33:01,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-01-10 06:33:01,684 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 108 flow. Second operand 4 states and 116 transitions. [2025-01-10 06:33:01,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 236 flow [2025-01-10 06:33:01,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:01,691 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 142 flow [2025-01-10 06:33:01,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-01-10 06:33:01,697 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 06:33:01,698 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 142 flow [2025-01-10 06:33:01,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-10 06:33:01,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:01,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:33:01,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:33:01,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1732754464, now seen corresponding path program 1 times [2025-01-10 06:33:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:01,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931995259] [2025-01-10 06:33:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:33:01,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:33:01,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:01,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:01,813 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-10 06:33:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:01,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931995259] [2025-01-10 06:33:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931995259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477583622] [2025-01-10 06:33:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:01,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:01,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:01,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:01,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-10 06:33:01,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:01,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:01,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-10 06:33:01,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:01,969 INFO L124 PetriNetUnfolderBase]: 71/252 cut-off events. [2025-01-10 06:33:01,969 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 06:33:01,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 252 events. 71/252 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1359 event pairs, 21 based on Foata normal form. 12/251 useless extension candidates. Maximal degree in co-relation 305. Up to 118 conditions per place. [2025-01-10 06:33:01,971 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 32 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-01-10 06:33:01,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 260 flow [2025-01-10 06:33:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-01-10 06:33:01,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-01-10 06:33:01,974 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 142 flow. Second operand 4 states and 115 transitions. [2025-01-10 06:33:01,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 260 flow [2025-01-10 06:33:01,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:01,976 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 154 flow [2025-01-10 06:33:01,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-01-10 06:33:01,976 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 06:33:01,976 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 154 flow [2025-01-10 06:33:01,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:01,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:01,977 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:33:01,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:01,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1730060627, now seen corresponding path program 1 times [2025-01-10 06:33:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:01,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510238896] [2025-01-10 06:33:01,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:33:02,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:33:02,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:02,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:33:02,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:33:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:33:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:02,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:33:02,033 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:33:02,033 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:33:02,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-01-10 06:33:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:33:02,038 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 06:33:02,039 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:33:02,039 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:33:02,054 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-10 06:33:02,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 162 flow [2025-01-10 06:33:02,080 INFO L124 PetriNetUnfolderBase]: 57/387 cut-off events. [2025-01-10 06:33:02,080 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 06:33:02,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 387 events. 57/387 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2180 event pairs, 2 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 237. Up to 32 conditions per place. [2025-01-10 06:33:02,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 59 transitions, 162 flow [2025-01-10 06:33:02,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 58 transitions, 160 flow [2025-01-10 06:33:02,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:33:02,083 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;@561be93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:33:02,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:33:02,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:33:02,085 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-10 06:33:02,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:02,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:02,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:02,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:02,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:02,086 INFO L85 PathProgramCache]: Analyzing trace with hash 414193209, now seen corresponding path program 1 times [2025-01-10 06:33:02,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899807130] [2025-01-10 06:33:02,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:02,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:02,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:02,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:02,126 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-10 06:33:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:02,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899807130] [2025-01-10 06:33:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899807130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:02,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223415245] [2025-01-10 06:33:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:02,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:02,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:02,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:02,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:33:02,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-10 06:33:02,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:02,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:33:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:02,516 INFO L124 PetriNetUnfolderBase]: 1575/3507 cut-off events. [2025-01-10 06:33:02,516 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-01-10 06:33:02,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 3507 events. 1575/3507 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 29721 event pairs, 669 based on Foata normal form. 2/3058 useless extension candidates. Maximal degree in co-relation 2329. Up to 1361 conditions per place. [2025-01-10 06:33:02,537 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 53 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-01-10 06:33:02,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 364 flow [2025-01-10 06:33:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-01-10 06:33:02,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-01-10 06:33:02,540 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 160 flow. Second operand 4 states and 160 transitions. [2025-01-10 06:33:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 364 flow [2025-01-10 06:33:02,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:02,543 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 232 flow [2025-01-10 06:33:02,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2025-01-10 06:33:02,544 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2025-01-10 06:33:02,545 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 232 flow [2025-01-10 06:33:02,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-10 06:33:02,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:02,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:33:02,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:33:02,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -46488823, now seen corresponding path program 1 times [2025-01-10 06:33:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43859003] [2025-01-10 06:33:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:02,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:33:02,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:33:02,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:02,607 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-10 06:33:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43859003] [2025-01-10 06:33:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43859003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195678867] [2025-01-10 06:33:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:02,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:02,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:02,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:02,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:33:02,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-10 06:33:02,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:02,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:33:02,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:03,011 INFO L124 PetriNetUnfolderBase]: 1663/3567 cut-off events. [2025-01-10 06:33:03,012 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2025-01-10 06:33:03,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 3567 events. 1663/3567 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 29623 event pairs, 710 based on Foata normal form. 28/3342 useless extension candidates. Maximal degree in co-relation 2629. Up to 1497 conditions per place. [2025-01-10 06:33:03,028 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 55 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2025-01-10 06:33:03,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 428 flow [2025-01-10 06:33:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-01-10 06:33:03,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6864406779661016 [2025-01-10 06:33:03,029 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 232 flow. Second operand 4 states and 162 transitions. [2025-01-10 06:33:03,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 428 flow [2025-01-10 06:33:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:03,032 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 268 flow [2025-01-10 06:33:03,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-01-10 06:33:03,033 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2025-01-10 06:33:03,033 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 268 flow [2025-01-10 06:33:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-10 06:33:03,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:03,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:03,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:33:03,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -645041573, now seen corresponding path program 1 times [2025-01-10 06:33:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287034287] [2025-01-10 06:33:03,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:03,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:03,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:03,093 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-10 06:33:03,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287034287] [2025-01-10 06:33:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287034287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:03,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:03,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:03,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031318742] [2025-01-10 06:33:03,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:03,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:03,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:03,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:03,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:33:03,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-10 06:33:03,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:03,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:33:03,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:03,480 INFO L124 PetriNetUnfolderBase]: 1571/3471 cut-off events. [2025-01-10 06:33:03,481 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2025-01-10 06:33:03,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7753 conditions, 3471 events. 1571/3471 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 29042 event pairs, 336 based on Foata normal form. 4/3240 useless extension candidates. Maximal degree in co-relation 2751. Up to 1332 conditions per place. [2025-01-10 06:33:03,496 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 54 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2025-01-10 06:33:03,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 464 flow [2025-01-10 06:33:03,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-01-10 06:33:03,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2025-01-10 06:33:03,497 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 268 flow. Second operand 6 states and 210 transitions. [2025-01-10 06:33:03,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 464 flow [2025-01-10 06:33:03,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 89 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:03,501 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 278 flow [2025-01-10 06:33:03,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-01-10 06:33:03,502 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-01-10 06:33:03,502 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 278 flow [2025-01-10 06:33:03,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-10 06:33:03,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:03,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:33:03,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:33:03,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:03,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1478548146, now seen corresponding path program 1 times [2025-01-10 06:33:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965363896] [2025-01-10 06:33:03,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:03,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:03,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:03,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:03,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:03,584 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-10 06:33:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965363896] [2025-01-10 06:33:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965363896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:03,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:03,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89803279] [2025-01-10 06:33:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:03,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:03,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:03,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:33:03,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-10 06:33:03,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:03,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:33:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:03,904 INFO L124 PetriNetUnfolderBase]: 1567/3460 cut-off events. [2025-01-10 06:33:03,905 INFO L125 PetriNetUnfolderBase]: For 2075/2075 co-relation queries the response was YES. [2025-01-10 06:33:03,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7854 conditions, 3460 events. 1567/3460 cut-off events. For 2075/2075 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 28970 event pairs, 325 based on Foata normal form. 4/3237 useless extension candidates. Maximal degree in co-relation 2788. Up to 1332 conditions per place. [2025-01-10 06:33:03,922 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 54 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2025-01-10 06:33:03,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 488 flow [2025-01-10 06:33:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-01-10 06:33:03,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596045197740113 [2025-01-10 06:33:03,924 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 278 flow. Second operand 6 states and 211 transitions. [2025-01-10 06:33:03,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 488 flow [2025-01-10 06:33:03,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 462 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 06:33:03,927 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 282 flow [2025-01-10 06:33:03,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-01-10 06:33:03,928 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-01-10 06:33:03,928 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 282 flow [2025-01-10 06:33:03,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-10 06:33:03,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:03,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:03,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:33:03,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:03,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2081121087, now seen corresponding path program 1 times [2025-01-10 06:33:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098863681] [2025-01-10 06:33:03,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:03,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:03,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:03,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:03,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:03,996 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-10 06:33:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:03,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098863681] [2025-01-10 06:33:03,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098863681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:03,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:03,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:33:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852958288] [2025-01-10 06:33:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:03,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:03,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:03,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:03,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:04,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:33:04,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-10 06:33:04,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:04,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:33:04,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:04,371 INFO L124 PetriNetUnfolderBase]: 1615/3476 cut-off events. [2025-01-10 06:33:04,372 INFO L125 PetriNetUnfolderBase]: For 2086/2086 co-relation queries the response was YES. [2025-01-10 06:33:04,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7915 conditions, 3476 events. 1615/3476 cut-off events. For 2086/2086 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 28809 event pairs, 323 based on Foata normal form. 28/3279 useless extension candidates. Maximal degree in co-relation 2803. Up to 1304 conditions per place. [2025-01-10 06:33:04,395 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 60 selfloop transitions, 12 changer transitions 0/94 dead transitions. [2025-01-10 06:33:04,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 504 flow [2025-01-10 06:33:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-01-10 06:33:04,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2025-01-10 06:33:04,397 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 282 flow. Second operand 6 states and 216 transitions. [2025-01-10 06:33:04,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 504 flow [2025-01-10 06:33:04,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 491 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:04,403 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 289 flow [2025-01-10 06:33:04,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 06:33:04,403 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2025-01-10 06:33:04,404 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 289 flow [2025-01-10 06:33:04,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-10 06:33:04,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:04,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:04,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:33:04,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:04,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash -90243842, now seen corresponding path program 1 times [2025-01-10 06:33:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:04,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250006860] [2025-01-10 06:33:04,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:04,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:04,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:33:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:33:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:04,489 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-10 06:33:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250006860] [2025-01-10 06:33:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250006860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:33:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784472740] [2025-01-10 06:33:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:04,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:04,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:04,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:04,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:33:04,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-10 06:33:04,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:04,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:33:04,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:04,883 INFO L124 PetriNetUnfolderBase]: 1567/3407 cut-off events. [2025-01-10 06:33:04,883 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2025-01-10 06:33:04,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7949 conditions, 3407 events. 1567/3407 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 28432 event pairs, 483 based on Foata normal form. 28/3238 useless extension candidates. Maximal degree in co-relation 2831. Up to 1304 conditions per place. [2025-01-10 06:33:04,904 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 60 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2025-01-10 06:33:04,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 526 flow [2025-01-10 06:33:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-01-10 06:33:04,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129943502824858 [2025-01-10 06:33:04,907 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 289 flow. Second operand 6 states and 217 transitions. [2025-01-10 06:33:04,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 526 flow [2025-01-10 06:33:04,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 498 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 06:33:04,915 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 294 flow [2025-01-10 06:33:04,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 06:33:04,917 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2025-01-10 06:33:04,917 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 294 flow [2025-01-10 06:33:04,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-10 06:33:04,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:04,918 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:33:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:33:04,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash -749393717, now seen corresponding path program 1 times [2025-01-10 06:33:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983723735] [2025-01-10 06:33:04,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:33:04,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:33:04,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:04,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:04,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:33:04,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:33:04,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:33:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:04,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:33:04,953 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:33:04,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:33:04,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 06:33:04,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:33:04,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-01-10 06:33:04,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:33:04,954 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:04,955 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:33:04,955 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:33:04,980 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-10 06:33:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 73 transitions, 218 flow [2025-01-10 06:33:05,040 INFO L124 PetriNetUnfolderBase]: 336/1466 cut-off events. [2025-01-10 06:33:05,040 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-01-10 06:33:05,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1466 events. 336/1466 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 10388 event pairs, 64 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 941. Up to 192 conditions per place. [2025-01-10 06:33:05,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 73 transitions, 218 flow [2025-01-10 06:33:05,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 216 flow [2025-01-10 06:33:05,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:33:05,047 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;@561be93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:33:05,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:33:05,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:33:05,049 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-10 06:33:05,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:05,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:05,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:05,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash 481956552, now seen corresponding path program 1 times [2025-01-10 06:33:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812527896] [2025-01-10 06:33:05,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:05,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:05,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:05,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:05,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:05,092 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-10 06:33:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812527896] [2025-01-10 06:33:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812527896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205628423] [2025-01-10 06:33:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:05,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:05,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:05,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:05,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-10 06:33:05,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:05,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:05,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:07,846 INFO L124 PetriNetUnfolderBase]: 21857/38845 cut-off events. [2025-01-10 06:33:07,847 INFO L125 PetriNetUnfolderBase]: For 5140/5140 co-relation queries the response was YES. [2025-01-10 06:33:07,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75258 conditions, 38845 events. 21857/38845 cut-off events. For 5140/5140 co-relation queries the response was YES. Maximal size of possible extension queue 1879. Compared 375129 event pairs, 10131 based on Foata normal form. 2/35204 useless extension candidates. Maximal degree in co-relation 22445. Up to 17821 conditions per place. [2025-01-10 06:33:08,060 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 67 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2025-01-10 06:33:08,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 472 flow [2025-01-10 06:33:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-01-10 06:33:08,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678082191780822 [2025-01-10 06:33:08,062 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 216 flow. Second operand 4 states and 198 transitions. [2025-01-10 06:33:08,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 472 flow [2025-01-10 06:33:08,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:08,069 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 288 flow [2025-01-10 06:33:08,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2025-01-10 06:33:08,069 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-01-10 06:33:08,070 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 288 flow [2025-01-10 06:33:08,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-10 06:33:08,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:08,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:33:08,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:33:08,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2053945202, now seen corresponding path program 1 times [2025-01-10 06:33:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:08,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736643054] [2025-01-10 06:33:08,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:08,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:33:08,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:33:08,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:08,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:08,108 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-10 06:33:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736643054] [2025-01-10 06:33:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736643054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257566533] [2025-01-10 06:33:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:08,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:08,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:08,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:08,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-10 06:33:08,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:08,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:08,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:10,906 INFO L124 PetriNetUnfolderBase]: 22713/39641 cut-off events. [2025-01-10 06:33:10,906 INFO L125 PetriNetUnfolderBase]: For 9742/9742 co-relation queries the response was YES. [2025-01-10 06:33:11,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82764 conditions, 39641 events. 22713/39641 cut-off events. For 9742/9742 co-relation queries the response was YES. Maximal size of possible extension queue 1894. Compared 382037 event pairs, 10129 based on Foata normal form. 60/37256 useless extension candidates. Maximal degree in co-relation 25155. Up to 19013 conditions per place. [2025-01-10 06:33:11,237 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 70 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2025-01-10 06:33:11,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 540 flow [2025-01-10 06:33:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-01-10 06:33:11,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883561643835616 [2025-01-10 06:33:11,241 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 288 flow. Second operand 4 states and 201 transitions. [2025-01-10 06:33:11,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 540 flow [2025-01-10 06:33:11,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:11,248 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 324 flow [2025-01-10 06:33:11,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-01-10 06:33:11,251 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 11 predicate places. [2025-01-10 06:33:11,251 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 324 flow [2025-01-10 06:33:11,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-10 06:33:11,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:11,251 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:11,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:33:11,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash -261098565, now seen corresponding path program 1 times [2025-01-10 06:33:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:11,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882898240] [2025-01-10 06:33:11,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:11,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:11,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:11,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:11,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:11,337 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-10 06:33:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882898240] [2025-01-10 06:33:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882898240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:11,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:11,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986004745] [2025-01-10 06:33:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:11,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:11,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:11,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:11,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:11,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 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-10 06:33:11,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:11,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:11,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:14,324 INFO L124 PetriNetUnfolderBase]: 21841/38750 cut-off events. [2025-01-10 06:33:14,325 INFO L125 PetriNetUnfolderBase]: For 14584/14584 co-relation queries the response was YES. [2025-01-10 06:33:14,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84450 conditions, 38750 events. 21841/38750 cut-off events. For 14584/14584 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 376322 event pairs, 4835 based on Foata normal form. 12/36471 useless extension candidates. Maximal degree in co-relation 25699. Up to 17653 conditions per place. [2025-01-10 06:33:14,799 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 70 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2025-01-10 06:33:14,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 580 flow [2025-01-10 06:33:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-01-10 06:33:14,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5981735159817352 [2025-01-10 06:33:14,801 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 324 flow. Second operand 6 states and 262 transitions. [2025-01-10 06:33:14,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 580 flow [2025-01-10 06:33:14,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:14,825 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 334 flow [2025-01-10 06:33:14,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2025-01-10 06:33:14,826 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2025-01-10 06:33:14,826 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 334 flow [2025-01-10 06:33:14,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 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-10 06:33:14,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:14,827 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:33:14,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:33:14,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash 495879577, now seen corresponding path program 1 times [2025-01-10 06:33:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924357431] [2025-01-10 06:33:14,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:14,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:14,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:14,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:14,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:14,885 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-10 06:33:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:14,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924357431] [2025-01-10 06:33:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924357431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:14,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:14,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091863269] [2025-01-10 06:33:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:14,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:14,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:14,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:14,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:14,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 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-10 06:33:14,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:14,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:17,882 INFO L124 PetriNetUnfolderBase]: 21837/38746 cut-off events. [2025-01-10 06:33:17,882 INFO L125 PetriNetUnfolderBase]: For 19233/19233 co-relation queries the response was YES. [2025-01-10 06:33:17,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85350 conditions, 38746 events. 21837/38746 cut-off events. For 19233/19233 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 375935 event pairs, 6413 based on Foata normal form. 4/36471 useless extension candidates. Maximal degree in co-relation 26025. Up to 17765 conditions per place. [2025-01-10 06:33:18,108 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 71 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2025-01-10 06:33:18,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 113 transitions, 618 flow [2025-01-10 06:33:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-01-10 06:33:18,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6027397260273972 [2025-01-10 06:33:18,110 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 334 flow. Second operand 6 states and 264 transitions. [2025-01-10 06:33:18,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 113 transitions, 618 flow [2025-01-10 06:33:18,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 594 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:18,134 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 367 flow [2025-01-10 06:33:18,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-01-10 06:33:18,136 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 18 predicate places. [2025-01-10 06:33:18,136 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 367 flow [2025-01-10 06:33:18,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 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-10 06:33:18,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:18,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:18,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:33:18,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:18,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1311105608, now seen corresponding path program 1 times [2025-01-10 06:33:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:18,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80794760] [2025-01-10 06:33:18,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:18,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:18,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:18,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:18,198 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-10 06:33:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:18,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80794760] [2025-01-10 06:33:18,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80794760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:18,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:33:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146301075] [2025-01-10 06:33:18,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:18,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:18,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:18,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:18,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:18,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-10 06:33:18,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:18,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:18,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:20,976 INFO L124 PetriNetUnfolderBase]: 22269/38986 cut-off events. [2025-01-10 06:33:20,977 INFO L125 PetriNetUnfolderBase]: For 19637/19637 co-relation queries the response was YES. [2025-01-10 06:33:21,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86046 conditions, 38986 events. 22269/38986 cut-off events. For 19637/19637 co-relation queries the response was YES. Maximal size of possible extension queue 1888. Compared 376456 event pairs, 5004 based on Foata normal form. 180/36901 useless extension candidates. Maximal degree in co-relation 26274. Up to 15201 conditions per place. [2025-01-10 06:33:21,256 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 81 selfloop transitions, 12 changer transitions 0/122 dead transitions. [2025-01-10 06:33:21,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 122 transitions, 665 flow [2025-01-10 06:33:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-01-10 06:33:21,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-01-10 06:33:21,258 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 367 flow. Second operand 6 states and 271 transitions. [2025-01-10 06:33:21,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 122 transitions, 665 flow [2025-01-10 06:33:21,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 122 transitions, 652 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:21,275 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 374 flow [2025-01-10 06:33:21,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2025-01-10 06:33:21,276 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 20 predicate places. [2025-01-10 06:33:21,276 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 374 flow [2025-01-10 06:33:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-10 06:33:21,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:21,277 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:33:21,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1989568670, now seen corresponding path program 1 times [2025-01-10 06:33:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697899678] [2025-01-10 06:33:21,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:21,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:33:21,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:33:21,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:21,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:21,330 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-10 06:33:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697899678] [2025-01-10 06:33:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697899678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:33:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923261084] [2025-01-10 06:33:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:21,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:21,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:21,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:21,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:21,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-10 06:33:21,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:21,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:21,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:24,296 INFO L124 PetriNetUnfolderBase]: 22141/38813 cut-off events. [2025-01-10 06:33:24,296 INFO L125 PetriNetUnfolderBase]: For 20789/20789 co-relation queries the response was YES. [2025-01-10 06:33:24,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87168 conditions, 38813 events. 22141/38813 cut-off events. For 20789/20789 co-relation queries the response was YES. Maximal size of possible extension queue 1888. Compared 374783 event pairs, 7911 based on Foata normal form. 60/36608 useless extension candidates. Maximal degree in co-relation 26679. Up to 17697 conditions per place. [2025-01-10 06:33:24,668 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 82 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2025-01-10 06:33:24,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 124 transitions, 701 flow [2025-01-10 06:33:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2025-01-10 06:33:24,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6232876712328768 [2025-01-10 06:33:24,673 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 374 flow. Second operand 6 states and 273 transitions. [2025-01-10 06:33:24,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 124 transitions, 701 flow [2025-01-10 06:33:24,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 124 transitions, 671 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:24,697 INFO L231 Difference]: Finished difference. Result has 97 places, 85 transitions, 404 flow [2025-01-10 06:33:24,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=97, PETRI_TRANSITIONS=85} [2025-01-10 06:33:24,698 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2025-01-10 06:33:24,698 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 404 flow [2025-01-10 06:33:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-10 06:33:24,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:24,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:33:24,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -255220271, now seen corresponding path program 1 times [2025-01-10 06:33:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197543821] [2025-01-10 06:33:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:24,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:33:24,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:33:24,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:24,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:24,749 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-10 06:33:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197543821] [2025-01-10 06:33:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197543821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325824796] [2025-01-10 06:33:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:24,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:24,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:24,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:24,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-10 06:33:24,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:24,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:24,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:27,697 INFO L124 PetriNetUnfolderBase]: 23397/39147 cut-off events. [2025-01-10 06:33:27,697 INFO L125 PetriNetUnfolderBase]: For 21389/21389 co-relation queries the response was YES. [2025-01-10 06:33:27,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89856 conditions, 39147 events. 23397/39147 cut-off events. For 21389/21389 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 361293 event pairs, 10320 based on Foata normal form. 922/38723 useless extension candidates. Maximal degree in co-relation 27077. Up to 20283 conditions per place. [2025-01-10 06:33:27,957 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 76 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2025-01-10 06:33:27,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 674 flow [2025-01-10 06:33:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 06:33:27,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952054794520548 [2025-01-10 06:33:27,959 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 404 flow. Second operand 4 states and 203 transitions. [2025-01-10 06:33:27,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 674 flow [2025-01-10 06:33:27,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 115 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:27,977 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 434 flow [2025-01-10 06:33:27,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=434, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2025-01-10 06:33:27,979 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 27 predicate places. [2025-01-10 06:33:27,979 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 434 flow [2025-01-10 06:33:27,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-10 06:33:27,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:27,979 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:33:27,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:33:27,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:27,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109739, now seen corresponding path program 1 times [2025-01-10 06:33:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66267958] [2025-01-10 06:33:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:27,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:33:27,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:33:27,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:27,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:28,071 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-10 06:33:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66267958] [2025-01-10 06:33:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66267958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:28,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:33:28,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763625647] [2025-01-10 06:33:28,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:28,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:28,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:28,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:28,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:28,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 434 flow. Second operand has 8 states, 8 states have (on average 31.625) internal successors, (253), 8 states have internal predecessors, (253), 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-10 06:33:28,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:28,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:28,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:30,884 INFO L124 PetriNetUnfolderBase]: 21825/37374 cut-off events. [2025-01-10 06:33:30,885 INFO L125 PetriNetUnfolderBase]: For 30385/30417 co-relation queries the response was YES. [2025-01-10 06:33:31,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90115 conditions, 37374 events. 21825/37374 cut-off events. For 30385/30417 co-relation queries the response was YES. Maximal size of possible extension queue 1812. Compared 344298 event pairs, 6680 based on Foata normal form. 8/36097 useless extension candidates. Maximal degree in co-relation 47402. Up to 17693 conditions per place. [2025-01-10 06:33:31,154 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 77 selfloop transitions, 16 changer transitions 0/122 dead transitions. [2025-01-10 06:33:31,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 735 flow [2025-01-10 06:33:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:33:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:33:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2025-01-10 06:33:31,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5667808219178082 [2025-01-10 06:33:31,156 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 434 flow. Second operand 8 states and 331 transitions. [2025-01-10 06:33:31,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 735 flow [2025-01-10 06:33:31,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 122 transitions, 720 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:31,216 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 458 flow [2025-01-10 06:33:31,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2025-01-10 06:33:31,216 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 31 predicate places. [2025-01-10 06:33:31,216 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 458 flow [2025-01-10 06:33:31,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.625) internal successors, (253), 8 states have internal predecessors, (253), 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-10 06:33:31,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:31,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:33:31,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1303649631, now seen corresponding path program 1 times [2025-01-10 06:33:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374837587] [2025-01-10 06:33:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:33:31,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:33:31,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:31,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:31,249 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-10 06:33:31,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374837587] [2025-01-10 06:33:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374837587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:31,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:31,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447936388] [2025-01-10 06:33:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:31,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:31,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:31,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:31,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:31,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-10 06:33:31,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:31,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:31,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:34,287 INFO L124 PetriNetUnfolderBase]: 23397/37809 cut-off events. [2025-01-10 06:33:34,287 INFO L125 PetriNetUnfolderBase]: For 31999/31999 co-relation queries the response was YES. [2025-01-10 06:33:34,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94037 conditions, 37809 events. 23397/37809 cut-off events. For 31999/31999 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 331572 event pairs, 11720 based on Foata normal form. 1330/38931 useless extension candidates. Maximal degree in co-relation 51068. Up to 20283 conditions per place. [2025-01-10 06:33:34,558 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 76 selfloop transitions, 12 changer transitions 0/115 dead transitions. [2025-01-10 06:33:34,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 115 transitions, 728 flow [2025-01-10 06:33:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 06:33:34,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952054794520548 [2025-01-10 06:33:34,559 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 458 flow. Second operand 4 states and 203 transitions. [2025-01-10 06:33:34,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 115 transitions, 728 flow [2025-01-10 06:33:34,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 115 transitions, 687 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-01-10 06:33:34,616 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 462 flow [2025-01-10 06:33:34,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2025-01-10 06:33:34,616 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 28 predicate places. [2025-01-10 06:33:34,616 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 462 flow [2025-01-10 06:33:34,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-10 06:33:34,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:34,617 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:34,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:33:34,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:34,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -641855661, now seen corresponding path program 1 times [2025-01-10 06:33:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33106928] [2025-01-10 06:33:34,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:34,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:33:34,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:33:34,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:34,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:34,673 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-10 06:33:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33106928] [2025-01-10 06:33:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33106928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:34,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:34,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:33:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847351674] [2025-01-10 06:33:34,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:34,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:34,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:34,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:34,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:34,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 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-10 06:33:34,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:34,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:34,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:37,635 INFO L124 PetriNetUnfolderBase]: 21825/36027 cut-off events. [2025-01-10 06:33:37,636 INFO L125 PetriNetUnfolderBase]: For 34121/34121 co-relation queries the response was YES. [2025-01-10 06:33:37,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93356 conditions, 36027 events. 21825/36027 cut-off events. For 34121/34121 co-relation queries the response was YES. Maximal size of possible extension queue 1704. Compared 325416 event pairs, 5983 based on Foata normal form. 120/36134 useless extension candidates. Maximal degree in co-relation 62289. Up to 16073 conditions per place. [2025-01-10 06:33:37,857 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 92 selfloop transitions, 17 changer transitions 0/137 dead transitions. [2025-01-10 06:33:37,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 825 flow [2025-01-10 06:33:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:33:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:33:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2025-01-10 06:33:37,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5924657534246576 [2025-01-10 06:33:37,859 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 462 flow. Second operand 8 states and 346 transitions. [2025-01-10 06:33:37,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 825 flow [2025-01-10 06:33:37,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 137 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:37,976 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 491 flow [2025-01-10 06:33:37,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-01-10 06:33:37,977 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 32 predicate places. [2025-01-10 06:33:37,977 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 491 flow [2025-01-10 06:33:37,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 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-10 06:33:37,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:37,977 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 06:33:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:33:37,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -494676628, now seen corresponding path program 1 times [2025-01-10 06:33:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015022402] [2025-01-10 06:33:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:37,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:33:37,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:33:37,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:37,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:37,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:33:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:33:37,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:33:37,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:37,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:37,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:33:38,000 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:33:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-01-10 06:33:38,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:33:38,001 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:38,001 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:33:38,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:33:38,025 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-01-10 06:33:38,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 278 flow [2025-01-10 06:33:38,251 INFO L124 PetriNetUnfolderBase]: 1817/5929 cut-off events. [2025-01-10 06:33:38,252 INFO L125 PetriNetUnfolderBase]: For 2144/2144 co-relation queries the response was YES. [2025-01-10 06:33:38,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8070 conditions, 5929 events. 1817/5929 cut-off events. For 2144/2144 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 50985 event pairs, 626 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 3890. Up to 1024 conditions per place. [2025-01-10 06:33:38,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 278 flow [2025-01-10 06:33:38,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 86 transitions, 276 flow [2025-01-10 06:33:38,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:33:38,286 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;@561be93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:33:38,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:33:38,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:33:38,287 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-10 06:33:38,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:38,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:38,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:38,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:38,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 563080165, now seen corresponding path program 1 times [2025-01-10 06:33:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:38,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396304560] [2025-01-10 06:33:38,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:38,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:38,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:38,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:38,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:38,314 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-10 06:33:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:38,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396304560] [2025-01-10 06:33:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396304560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:38,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457874471] [2025-01-10 06:33:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:38,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:38,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:38,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-01-10 06:33:38,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-10 06:33:38,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:38,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-01-10 06:33:38,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand